import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int sum = 0;

        for (int i = 0; i < 10; i++) {
            sum += sc.nextInt();
        }

        System.out.println(sum);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int sum = 0;

        for (int i = 0; i < 10; i++) {
            sum += sc.nextInt();
        }

        System.out.println(sum);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int totalScore = 0;
        for (int i = 0; i < 10; i++) {
            totalScore += sc.nextInt();
        }
        System.out.println(totalScore);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int sum = 0;

        for (int i = 0; i < 10; i++) {
            sum += scanner.nextInt();
        }

        System.out.println(sum);
        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int sum = 0;

        for (int i = 0; i < 10; i++) {
            sum += sc.nextInt();
        }

        System.out.println(sum);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int sum = 0;

        for (int i = 0; i < 10; i++) {
            sum += sc.nextInt();
        }

        System.out.println(sum);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int totalScore = 0;
        for (int i = 0; i < 10; i++) {
            totalScore += sc.nextInt();
        }
        System.out.println(totalScore);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int sum = 0;

        for (int i = 0; i < 10; i++) {
            sum += sc.nextInt();
        }

        System.out.println(sum);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int b1 = scanner.nextInt();
        int b2 = scanner.nextInt();
        int b3 = scanner.nextInt();

        if ((b1 == 1 && b2 == 1 && b3 == 0) || (b1 == 0 && b2 == 0 && b3 == 1)) {
            System.out.println("Open");
        } else {
            System.out.println("Close");
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int b1 = sc.nextInt();
        int b2 = sc.nextInt();
        int b3 = sc.nextInt();

        if ((b1 == 1 && b2 == 1 && b3 == 0) || (b1 == 0 && b2 == 0 && b3 == 1)) {
            System.out.println("Open");
        } else {
            System.out.println("Close");
        }
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int b1 = sc.nextInt();
        int b2 = sc.nextInt();
        int b3 = sc.nextInt();

        if ((b1 == 1 && b2 == 1 && b3 == 0) || (b1 == 0 && b2 == 0 && b3 == 1)) {
            System.out.println("Open");
        } else {
            System.out.println("Close");
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int b1 = sc.nextInt();
        int b2 = sc.nextInt();
        int b3 = sc.nextInt();

        if ((b1 == 1 && b2 == 1 && b3 == 0) || (b1 == 0 && b2 == 0 && b3 == 1)) {
            System.out.println("Open");
        } else {
            System.out.println("Close");
        }
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int b1 = scanner.nextInt();
        int b2 = scanner.nextInt();
        int b3 = scanner.nextInt();

        if ((b1 == 1 && b2 == 1 && b3 == 0) || (b1 == 0 && b2 == 0 && b3 == 1)) {
            System.out.println("Open");
        } else {
            System.out.println("Close");
        }

        scanner.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            if (n == 0) break;

            int[] heights = new int[n + 1];
            for (int i = 0; i < n + 1; i++) {
                heights[i] = sc.nextInt();
            }

            for (int remove = 0; remove < n + 1; remove++) {
                List<Integer> remaining = new ArrayList<>();
                for (int i = 0; i < n + 1; i++) {
                    if (i != remove) {
                        remaining.add(heights[i]);
                    }
                }

                Collections.sort(remaining);

                boolean isArithmetic = true;
                int diff = remaining.get(1) - remaining.get(0);
                for (int i = 2; i < remaining.size(); i++) {
                    if (remaining.get(i) - remaining.get(i-1) != diff) {
                        isArithmetic = false;
                        break;
                    }
                }

                if (isArithmetic) {
                    System.out.println(heights[remove]);
                    break;
                }
            }
        }
        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            if (n == 0) break;

            int[] heights = new int[n + 1];
            for (int i = 0; i < n + 1; i++) {
                heights[i] = sc.nextInt();
            }

            for (int remove = 0; remove < n + 1; remove++) {
                List<Integer> remaining = new ArrayList<>();
                for (int i = 0; i < n + 1; i++) {
                    if (i != remove) {
                        remaining.add(heights[i]);
                    }
                }

                Collections.sort(remaining);

                boolean isArithmetic = true;
                int diff = remaining.get(1) - remaining.get(0);
                for (int i = 2; i < remaining.size(); i++) {
                    if (remaining.get(i) - remaining.get(i-1) != diff) {
                        isArithmetic = false;
                        break;
                    }
                }

                if (isArithmetic) {
                    System.out.println(heights[remove]);
                    break;
                }
            }
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        for (int i = 0; i < 7; i++) {
            int maxTemp = sc.nextInt();
            int minTemp = sc.nextInt();
            System.out.println(maxTemp - minTemp);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class TemperatureDifference {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        for (int i = 0; i < 7; i++) {
            int a = scanner.nextInt();
            int b = scanner.nextInt();
            System.out.println(a - b);
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        for (int i = 0; i < 7; i++) {
            int highestTemp = sc.nextInt();
            int lowestTemp = sc.nextInt();

            System.out.println(highestTemp - lowestTemp);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        for (int i = 0; i < 7; i++) {
            int max = sc.nextInt();
            int min = sc.nextInt();
            System.out.println(max - min);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        for (int i = 0; i < 7; i++) {
            int maxTemp = scanner.nextInt();
            int minTemp = scanner.nextInt();
            System.out.println(maxTemp - minTemp);
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        for (int i = 0; i < 7; i++) {
            int max = sc.nextInt();
            int min = sc.nextInt();
            System.out.println(max - min);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class TemperatureDifference {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        for (int i = 0; i < 7; i++) {
            int high = scanner.nextInt();
            int low = scanner.nextInt();
            System.out.println(high - low);
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        for (int i = 0; i < 7; i++) {
            int maxTemp = sc.nextInt();
            int minTemp = sc.nextInt();
            System.out.println(maxTemp - minTemp);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class TemperatureDifference {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        for (int i = 0; i < 7; i++) {
            int a = scanner.nextInt();
            int b = scanner.nextInt();
            System.out.println(a - b);
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        for (int i = 0; i < 7; i++) {
            int a = scanner.nextInt();
            int b = scanner.nextInt();
            System.out.println(a - b);
        }
        scanner.close();
    }
}

import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        for (int i = 0; i < 7; i++) {
            int maxTemp = sc.nextInt();
            int minTemp = sc.nextInt();
            System.out.println(maxTemp - minTemp);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        for (int i = 0; i < 7; i++) {
            int maxTemp = sc.nextInt();
            int minTemp = sc.nextInt();
            System.out.println(maxTemp - minTemp);
        }
        sc.close();
    }
}

import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        for (int i = 0; i < 7; i++) {
            int a = sc.nextInt();
            int b = sc.nextInt();
            System.out.println(a - b);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int[] prices = {0, 6000, 4000, 3000, 2000};

        for (int i = 0; i < 4; i++) {
            int type = sc.nextInt();
            int count = sc.nextInt();
            int revenue = prices[type] * count;
            System.out.println(revenue);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int[] prices = {0, 6000, 4000, 3000, 2000};

        for (int i = 0; i < 4; i++) {
            int type = sc.nextInt();
            int count = sc.nextInt();
            int revenue = prices[type] * count;
            System.out.println(revenue);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int[] prices = {0, 6000, 4000, 3000, 2000};

        for (int i = 0; i < 4; i++) {
            int type = sc.nextInt();
            int count = sc.nextInt();
            int revenue = prices[type] * count;
            System.out.println(revenue);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int[] prices = {0, 6000, 4000, 3000, 2000};

        for (int i = 0; i < 4; i++) {
            int type = sc.nextInt();
            int count = sc.nextInt();
            System.out.println(prices[type] * count);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int[] prices = {0, 6000, 4000, 3000, 2000};

        for (int i = 0; i < 4; i++) {
            int type = sc.nextInt();
            int quantity = sc.nextInt();
            System.out.println(prices[type] * quantity);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int[] prices = {0, 6000, 4000, 3000, 2000};

        for (int i = 0; i < 4; i++) {
            int type = sc.nextInt();
            int count = sc.nextInt();
            System.out.println(prices[type] * count);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int[] prices = {0, 6000, 4000, 3000, 2000};

        for (int i = 0; i < 4; i++) {
            int type = sc.nextInt();
            int count = sc.nextInt();
            System.out.println(prices[type] * count);
        }
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int[] prices = {0, 6000, 4000, 3000, 2000};

        for (int i = 0; i < 4; i++) {
            int ticketType = sc.nextInt();
            int quantity = sc.nextInt();
            System.out.println(prices[ticketType] * quantity);
        }
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int[] prices = {0, 6000, 4000, 3000, 2000};

        for (int i = 0; i < 4; i++) {
            int type = sc.nextInt();
            int quantity = sc.nextInt();
            System.out.println(prices[type] * quantity);
        }
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        for (int i = 0; i < 3; i++) {
            int startH = sc.nextInt();
            int startM = sc.nextInt();
            int startS = sc.nextInt();
            int endH = sc.nextInt();
            int endM = sc.nextInt();
            int endS = sc.nextInt();

            int startTotal = startH * 3600 + startM * 60 + startS;
            int endTotal = endH * 3600 + endM * 60 + endS;

            int diff = endTotal - startTotal;

            int h = diff / 3600;
            int m = (diff % 3600) / 60;
            int s = diff % 60;

            System.out.println(h + " " + m + " " + s);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        for (int i = 0; i < 3; i++) {
            int inH = sc.nextInt();
            int inM = sc.nextInt();
            int inS = sc.nextInt();
            int outH = sc.nextInt();
            int outM = sc.nextInt();
            int outS = sc.nextInt();

            int totalSecondsIn = inH * 3600 + inM * 60 + inS;
            int totalSecondsOut = outH * 3600 + outM * 60 + outS;

            int durationSeconds = totalSecondsOut - totalSecondsIn;

            int h = durationSeconds / 3600;
            int m = (durationSeconds % 3600) / 60;
            int s = durationSeconds % 60;

            System.out.println(h + " " + m + " " + s);
        }
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        for (int i = 0; i < 3; i++) {
            int startH = sc.nextInt();
            int startM = sc.nextInt();
            int startS = sc.nextInt();
            int endH = sc.nextInt();
            int endM = sc.nextInt();
            int endS = sc.nextInt();

            int startTotal = startH * 3600 + startM * 60 + startS;
            int endTotal = endH * 3600 + endM * 60 + endS;

            int workSeconds = endTotal - startTotal;

            int hours = workSeconds / 3600;
            int minutes = (workSeconds % 3600) / 60;
            int seconds = workSeconds % 60;

            System.out.println(hours + " " + minutes + " " + seconds);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        for (int i = 0; i < 3; i++) {
            int startH = scanner.nextInt();
            int startM = scanner.nextInt();
            int startS = scanner.nextInt();
            int endH = scanner.nextInt();
            int endM = scanner.nextInt();
            int endS = scanner.nextInt();

            int startSeconds = startH * 3600 + startM * 60 + startS;
            int endSeconds = endH * 3600 + endM * 60 + endS;

            int workSeconds = endSeconds - startSeconds;

            int hours = workSeconds / 3600;
            int minutes = (workSeconds % 3600) / 60;
            int seconds = workSeconds % 60;

            System.out.println(hours + " " + minutes + " " + seconds);
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        for (int i = 0; i < 3; i++) {
            int h1 = sc.nextInt();
            int m1 = sc.nextInt();
            int s1 = sc.nextInt();
            int h2 = sc.nextInt();
            int m2 = sc.nextInt();
            int s2 = sc.nextInt();

            int start = h1 * 3600 + m1 * 60 + s1;
            int end = h2 * 3600 + m2 * 60 + s2;

            int diff = end - start;

            int hours = diff / 3600;
            int minutes = (diff % 3600) / 60;
            int seconds = diff % 60;

            System.out.println(hours + " " + minutes + " " + seconds);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        for (int i = 0; i < 3; i++) {
            int startH = sc.nextInt();
            int startM = sc.nextInt();
            int startS = sc.nextInt();
            int endH = sc.nextInt();
            int endM = sc.nextInt();
            int endS = sc.nextInt();

            int startTotal = startH * 3600 + startM * 60 + startS;
            int endTotal = endH * 3600 + endM * 60 + endS;

            int diff = endTotal - startTotal;

            int hours = diff / 3600;
            diff %= 3600;
            int minutes = diff / 60;
            int seconds = diff % 60;

            System.out.println(hours + " " + minutes + " " + seconds);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        for (int i = 0; i < 3; i++) {
            int h1 = sc.nextInt();
            int m1 = sc.nextInt();
            int s1 = sc.nextInt();
            int h2 = sc.nextInt();
            int m2 = sc.nextInt();
            int s2 = sc.nextInt();

            int totalSeconds1 = h1 * 3600 + m1 * 60 + s1;
            int totalSeconds2 = h2 * 3600 + m2 * 60 + s2;

            int diffSeconds = totalSeconds2 - totalSeconds1;

            int h = diffSeconds / 3600;
            diffSeconds %= 3600;
            int m = diffSeconds / 60;
            int s = diffSeconds % 60;

            System.out.println(h + " " + m + " " + s);
        }
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        for (int i = 0; i < 3; i++) {
            int startH = sc.nextInt();
            int startM = sc.nextInt();
            int startS = sc.nextInt();
            int endH = sc.nextInt();
            int endM = sc.nextInt();
            int endS = sc.nextInt();

            int startTimeInSeconds = startH * 3600 + startM * 60 + startS;
            int endTimeInSeconds = endH * 3600 + endM * 60 + endS;

            int durationInSeconds = endTimeInSeconds - startTimeInSeconds;

            int h = durationInSeconds / 3600;
            durationInSeconds %= 3600;
            int m = durationInSeconds / 60;
            int s = durationInSeconds % 60;

            System.out.println(h + " " + m + " " + s);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        for (int i = 0; i < 3; i++) {
            int h1 = sc.nextInt();
            int m1 = sc.nextInt();
            int s1 = sc.nextInt();
            int h2 = sc.nextInt();
            int m2 = sc.nextInt();
            int s2 = sc.nextInt();

            int totalSeconds1 = h1 * 3600 + m1 * 60 + s1;
            int totalSeconds2 = h2 * 3600 + m2 * 60 + s2;

            int diffSeconds = totalSeconds2 - totalSeconds1;

            int hours = diffSeconds / 3600;
            diffSeconds %= 3600;
            int minutes = diffSeconds / 60;
            int seconds = diffSeconds % 60;

            System.out.println(hours + " " + minutes + " " + seconds);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        for (int i = 0; i < 3; i++) {
            int h1 = sc.nextInt();
            int m1 = sc.nextInt();
            int s1 = sc.nextInt();
            int h2 = sc.nextInt();
            int m2 = sc.nextInt();
            int s2 = sc.nextInt();

            int totalSeconds1 = h1 * 3600 + m1 * 60 + s1;
            int totalSeconds2 = h2 * 3600 + m2 * 60 + s2;

            int durationSeconds = totalSeconds2 - totalSeconds1;

            int hours = durationSeconds / 3600;
            durationSeconds %= 3600;
            int minutes = durationSeconds / 60;
            int seconds = durationSeconds % 60;

            System.out.println(hours + " " + minutes + " " + seconds);
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int[] wScores = new int[10];
        for (int i = 0; i < 10; i++) {
            wScores[i] = sc.nextInt();
        }

        int[] kScores = new int[10];
        for (int i = 0; i < 10; i++) {
            kScores[i] = sc.nextInt();
        }

        Arrays.sort(wScores);
        Arrays.sort(kScores);

        int wTotal = wScores[9] + wScores[8] + wScores[7];
        int kTotal = kScores[9] + kScores[8] + kScores[7];

        System.out.println(wTotal + " " + kTotal);

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int[] wScores = new int[10];
        for (int i = 0; i < 10; i++) {
            wScores[i] = sc.nextInt();
        }

        int[] kScores = new int[10];
        for (int i = 0; i < 10; i++) {
            kScores[i] = sc.nextInt();
        }

        Arrays.sort(wScores);
        Arrays.sort(kScores);

        int wTotal = wScores[9] + wScores[8] + wScores[7];
        int kTotal = kScores[9] + kScores[8] + kScores[7];

        System.out.println(wTotal + " " + kTotal);

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int[] wScores = new int[10];
        for (int i = 0; i < 10; i++) {
            wScores[i] = sc.nextInt();
        }

        int[] kScores = new int[10];
        for (int i = 0; i < 10; i++) {
            kScores[i] = sc.nextInt();
        }

        Arrays.sort(wScores);
        Arrays.sort(kScores);

        int wSum = wScores[9] + wScores[8] + wScores[7];
        int kSum = kScores[9] + kScores[8] + kScores[7];

        System.out.println(wSum + " " + kSum);

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int[] wScores = new int[10];
        for (int i = 0; i < 10; i++) {
            wScores[i] = sc.nextInt();
        }

        int[] kScores = new int[10];
        for (int i = 0; i < 10; i++) {
            kScores[i] = sc.nextInt();
        }

        Arrays.sort(wScores);
        Arrays.sort(kScores);

        int wTotal = wScores[9] + wScores[8] + wScores[7];
        int kTotal = kScores[9] + kScores[8] + kScores[7];

        System.out.println(wTotal + " " + kTotal);

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        while (true) {
            int total = scanner.nextInt();
            if (total == 0) break;

            int sum = 0;
            for (int i = 0; i < 9; i++) {
                sum += scanner.nextInt();
            }

            System.out.println(total - sum);
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int total = sc.nextInt();
            if (total == 0) break;

            int sum = 0;
            for (int i = 0; i < 9; i++) {
                sum += sc.nextInt();
            }

            System.out.println(total - sum);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int total = sc.nextInt();
            if (total == 0) break;

            int sum = 0;
            for (int i = 0; i < 9; i++) {
                sum += sc.nextInt();
            }

            System.out.println(total - sum);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int total = sc.nextInt();
            if (total == 0) break;

            int sum = 0;
            for (int i = 0; i < 9; i++) {
                sum += sc.nextInt();
            }

            System.out.println(total - sum);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int total = sc.nextInt();
            if (total == 0) break;

            int sum = 0;
            for (int i = 0; i < 9; i++) {
                sum += sc.nextInt();
            }

            System.out.println(total - sum);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int N = sc.nextInt();
            int M = sc.nextInt();

            if (N == 0 && M == 0) break;

            int[] board = new int[N + 1];
            for (int i = 1; i <= N; i++) {
                board[i] = sc.nextInt();
            }

            int[] dice = new int[M + 1];
            for (int i = 1; i <= M; i++) {
                dice[i] = sc.nextInt();
            }

            int position = 1;
            int rolls = 0;

            while (position < N) {
                rolls++;
                position += dice[rolls];

                if (position >= N) break;

                position += board[position];

                if (position < 1) position = 1;
            }

            System.out.println(rolls);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int N = sc.nextInt();
            int M = sc.nextInt();

            if (N == 0 && M == 0) break;

            int[] board = new int[N + 1];
            for (int i = 1; i <= N; i++) {
                board[i] = sc.nextInt();
            }

            int[] dice = new int[M + 1];
            for (int i = 1; i <= M; i++) {
                dice[i] = sc.nextInt();
            }

            int position = 1;
            int rolls = 0;

            while (position < N) {
                rolls++;
                position += dice[rolls];

                if (position >= N) break;

                position += board[position];
                if (position < 1) position = 1;
            }

            System.out.println(rolls);
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            int m = sc.nextInt();

            if (n == 0 && m == 0) break;

            List<List<Integer>> graph = new ArrayList<>();
            for (int i = 0; i <= n; i++) {
                graph.add(new ArrayList<>());
            }

            for (int i = 0; i < m; i++) {
                int a = sc.nextInt();
                int b = sc.nextInt();
                graph.get(a).add(b);
                graph.get(b).add(a);
            }

            Set<Integer> invited = new HashSet<>();

            for (int friend : graph.get(1)) {
                invited.add(friend);
            }

            for (int friend : graph.get(1)) {
                for (int friendOfFriend : graph.get(friend)) {
                    if (friendOfFriend != 1) {
                        invited.add(friendOfFriend);
                    }
                }
            }

            System.out.println(invited.size());
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            int m = sc.nextInt();

            if (n == 0 && m == 0) break;

            List<List<Integer>> graph = new ArrayList<>();
            for (int i = 0; i <= n; i++) {
                graph.add(new ArrayList<>());
            }

            for (int i = 0; i < m; i++) {
                int a = sc.nextInt();
                int b = sc.nextInt();
                graph.get(a).add(b);
                graph.get(b).add(a);
            }

            Set<Integer> invited = new HashSet<>();

            for (int friend : graph.get(1)) {
                invited.add(friend);
            }

            for (int friend : graph.get(1)) {
                for (int friendOfFriend : graph.get(friend)) {
                    if (friendOfFriend != 1) {
                        invited.add(friendOfFriend);
                    }
                }
            }

            System.out.println(invited.size());
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            int m = sc.nextInt();

            if (n == 0 && m == 0) break;

            List<List<Integer>> adj = new ArrayList<>();
            for (int i = 0; i <= n; i++) {
                adj.add(new ArrayList<>());
            }

            for (int i = 0; i < m; i++) {
                int a = sc.nextInt();
                int b = sc.nextInt();
                adj.get(a).add(b);
                adj.get(b).add(a);
            }

            Set<Integer> invited = new HashSet<>();

            for (int friend : adj.get(1)) {
                invited.add(friend);
            }

            for (int friend : adj.get(1)) {
                for (int friendOfFriend : adj.get(friend)) {
                    if (friendOfFriend != 1) {
                        invited.add(friendOfFriend);
                    }
                }
            }

            System.out.println(invited.size());
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            int m = sc.nextInt();

            if (n == 0 && m == 0) break;

            List<List<Integer>> graph = new ArrayList<>();
            for (int i = 0; i <= n; i++) {
                graph.add(new ArrayList<>());
            }

            for (int i = 0; i < m; i++) {
                int a = sc.nextInt();
                int b = sc.nextInt();
                graph.get(a).add(b);
                graph.get(b).add(a);
            }

            Set<Integer> invited = new HashSet<>();

            for (int friend : graph.get(1)) {
                invited.add(friend);
            }

            for (int friend : graph.get(1)) {
                for (int friendOfFriend : graph.get(friend)) {
                    if (friendOfFriend != 1) {
                        invited.add(friendOfFriend);
                    }
                }
            }

            System.out.println(invited.size());
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        int time1 = scanner.nextInt();
        int time2 = scanner.nextInt();
        int time3 = scanner.nextInt();
        int time4 = scanner.nextInt();

        int totalSeconds = time1 + time2 + time3 + time4;

        int minutes = totalSeconds / 60;
        int seconds = totalSeconds % 60;

        System.out.println(minutes);
        System.out.println(seconds);

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        int time1 = scanner.nextInt();
        int time2 = scanner.nextInt();
        int time3 = scanner.nextInt();
        int time4 = scanner.nextInt();

        int totalSeconds = time1 + time2 + time3 + time4;

        int minutes = totalSeconds / 60;
        int seconds = totalSeconds % 60;

        System.out.println(minutes);
        System.out.println(seconds);

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        int time1 = scanner.nextInt();
        int time2 = scanner.nextInt();
        int time3 = scanner.nextInt();
        int time4 = scanner.nextInt();

        int totalSeconds = time1 + time2 + time3 + time4;

        int minutes = totalSeconds / 60;
        int seconds = totalSeconds % 60;

        System.out.println(minutes);
        System.out.println(seconds);

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int time1 = sc.nextInt();
        int time2 = sc.nextInt();
        int time3 = sc.nextInt();
        int time4 = sc.nextInt();

        int totalSeconds = time1 + time2 + time3 + time4;

        int minutes = totalSeconds / 60;
        int seconds = totalSeconds % 60;

        System.out.println(minutes);
        System.out.println(seconds);

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int total = 0;
        for (int i = 0; i < 4; i++) {
            total += sc.nextInt();
        }

        int minutes = total / 60;
        int seconds = total % 60;

        System.out.println(minutes);
        System.out.println(seconds);

        sc.close();
    }
}

import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int totalSeconds = 0;

        for (int i = 0; i < 4; i++) {
            totalSeconds += sc.nextInt();
        }

        int minutes = totalSeconds / 60;
        int seconds = totalSeconds % 60;

        System.out.println(minutes);
        System.out.println(seconds);

        sc.close();
    }
}

import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int totalSeconds = 0;
        for (int i = 0; i < 4; i++) {
            totalSeconds += sc.nextInt();
        }

        int minutes = totalSeconds / 60;
        int seconds = totalSeconds % 60;

        System.out.println(minutes);
        System.out.println(seconds);

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        String target = sc.nextLine();
        int n = Integer.parseInt(sc.nextLine());

        int count = 0;

        for (int i = 0; i < n; i++) {
            String ring = sc.nextLine();
            String doubled = ring + ring;

            if (doubled.contains(target)) {
                count++;
            }
        }

        System.out.println(count);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String target = sc.nextLine();
        int n = Integer.parseInt(sc.nextLine());

        int count = 0;
        for (int i = 0; i < n; i++) {
            String ring = sc.nextLine();
            String doubled = ring + ring;
            if (doubled.contains(target)) {
                count++;
            }
        }

        System.out.println(count);
        sc.close();
    }
}

import java.util.Scanner;

public class Ring {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        String target = sc.nextLine();
        int n = Integer.parseInt(sc.nextLine());

        int count = 0;

        for (int i = 0; i < n; i++) {
            String ring = sc.nextLine();
            String doubled = ring + ring;

            if (doubled.contains(target)) {
                count++;
            }
        }

        System.out.println(count);
        sc.close();
    }
}

import java.util.Scanner;

public class Ring {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String target = sc.nextLine();
        int n = Integer.parseInt(sc.nextLine());

        int count = 0;
        for (int i = 0; i < n; i++) {
            String ring = sc.nextLine();
            String doubled = ring + ring;
            if (doubled.contains(target)) {
                count++;
            }
        }

        System.out.println(count);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        String target = sc.nextLine();
        int n = Integer.parseInt(sc.nextLine());

        int count = 0;

        for (int i = 0; i < n; i++) {
            String ring = sc.nextLine();
            String doubled = ring + ring;

            if (doubled.contains(target)) {
                count++;
            }
        }

        System.out.println(count);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int K = sc.nextInt();

        for (int i = 0; i < K; i++) {
            int a = sc.nextInt();
            int b = sc.nextInt();

            int distFromEdge = Math.min(Math.min(a - 1, N - a), Math.min(b - 1, N - b));

            int color = (distFromEdge % 3) + 1;

            System.out.println(color);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int K = sc.nextInt();

        for (int i = 0; i < K; i++) {
            int a = sc.nextInt();
            int b = sc.nextInt();

            int dist = Math.min(Math.min(a - 1, N - a), Math.min(b - 1, N - b));

            int color = (dist % 3) + 1;
            System.out.println(color);
        }
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int N = sc.nextInt();
        int K = sc.nextInt();

        for (int i = 0; i < K; i++) {
            int a = sc.nextInt();
            int b = sc.nextInt();

            int layer = Math.min(Math.min(a - 1, N - a), Math.min(b - 1, N - b));

            int color = (layer % 3) + 1;

            System.out.println(color);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int K = sc.nextInt();

        for (int i = 0; i < K; i++) {
            int a = sc.nextInt();
            int b = sc.nextInt();

            int dist = Math.min(Math.min(a - 1, N - a), Math.min(b - 1, N - b));

            int color = (dist % 3) + 1;
            System.out.println(color);
        }
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int M = sc.nextInt();
        int N = sc.nextInt();
        int K = sc.nextInt();

        char[][] grid = new char[M][N];
        for (int i = 0; i < M; i++) {
            String line = sc.next();
            for (int j = 0; j < N; j++) {
                grid[i][j] = line.charAt(j);
            }
        }

        int[][][] prefix = new int[3][M + 1][N + 1];

        for (int i = 1; i <= M; i++) {
            for (int j = 1; j <= N; j++) {
                char terrain = grid[i - 1][j - 1];

                for (int t = 0; t < 3; t++) {
                    prefix[t][i][j] = prefix[t][i - 1][j] + prefix[t][i][j - 1] - prefix[t][i - 1][j - 1];
                }

                if (terrain == 'J') {
                    prefix[0][i][j]++;
                } else if (terrain == 'O') {
                    prefix[1][i][j]++;
                } else if (terrain == 'I') {
                    prefix[2][i][j]++;
                }
            }
        }

        for (int q = 0; q < K; q++) {
            int a = sc.nextInt();
            int b = sc.nextInt();
            int c = sc.nextInt();
            int d = sc.nextInt();

            int[] counts = new int[3];
            for (int t = 0; t < 3; t++) {
                counts[t] = prefix[t][c][d] - prefix[t][a - 1][d] - prefix[t][c][b - 1] + prefix[t][a - 1][b - 1];
            }

            System.out.println(counts[0] + " " + counts[1] + " " + counts[2]);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int M = sc.nextInt();
        int N = sc.nextInt();
        int K = sc.nextInt();

        char[][] grid = new char[M][N];
        for (int i = 0; i < M; i++) {
            String line = sc.next();
            for (int j = 0; j < N; j++) {
                grid[i][j] = line.charAt(j);
            }
        }

        int[][][] prefix = new int[3][M + 1][N + 1];

        for (int i = 1; i <= M; i++) {
            for (int j = 1; j <= N; j++) {
                char terrain = grid[i-1][j-1];

                for (int t = 0; t < 3; t++) {
                    prefix[t][i][j] = prefix[t][i-1][j] + prefix[t][i][j-1] - prefix[t][i-1][j-1];
                }

                if (terrain == 'J') {
                    prefix[0][i][j]++;
                } else if (terrain == 'O') {
                    prefix[1][i][j]++;
                } else if (terrain == 'I') {
                    prefix[2][i][j]++;
                }
            }
        }

        for (int q = 0; q < K; q++) {
            int a = sc.nextInt();
            int b = sc.nextInt();
            int c = sc.nextInt();
            int d = sc.nextInt();

            int[] count = new int[3];
            for (int t = 0; t < 3; t++) {
                count[t] = prefix[t][c][d] - prefix[t][a-1][d] - prefix[t][c][b-1] + prefix[t][a-1][b-1];
            }

            System.out.println(count[0] + " " + count[1] + " " + count[2]);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int M = sc.nextInt();
        int N = sc.nextInt();
        int K = sc.nextInt();

        char[][] grid = new char[M][N];
        for (int i = 0; i < M; i++) {
            String line = sc.next();
            for (int j = 0; j < N; j++) {
                grid[i][j] = line.charAt(j);
            }
        }

        int[][][] prefix = new int[3][M + 1][N + 1];

        for (int i = 1; i <= M; i++) {
            for (int j = 1; j <= N; j++) {
                char terrain = grid[i - 1][j - 1];

                for (int t = 0; t < 3; t++) {
                    prefix[t][i][j] = prefix[t][i - 1][j] + prefix[t][i][j - 1] - prefix[t][i - 1][j - 1];
                }

                if (terrain == 'J') {
                    prefix[0][i][j]++;
                } else if (terrain == 'O') {
                    prefix[1][i][j]++;
                } else if (terrain == 'I') {
                    prefix[2][i][j]++;
                }
            }
        }

        for (int q = 0; q < K; q++) {
            int a = sc.nextInt();
            int b = sc.nextInt();
            int c = sc.nextInt();
            int d = sc.nextInt();

            int[] counts = new int[3];
            for (int t = 0; t < 3; t++) {
                counts[t] = prefix[t][c][d] - prefix[t][a - 1][d] - prefix[t][c][b - 1] + prefix[t][a - 1][b - 1];
            }

            System.out.println(counts[0] + " " + counts[1] + " " + counts[2]);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int pasta1 = sc.nextInt();
        int pasta2 = sc.nextInt();
        int pasta3 = sc.nextInt();

        int juice1 = sc.nextInt();
        int juice2 = sc.nextInt();

        int minPasta = Math.min(pasta1, Math.min(pasta2, pasta3));

        int minJuice = Math.min(juice1, juice2);

        int minPrice = minPasta + minJuice - 50;

        System.out.println(minPrice);

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int pasta1 = sc.nextInt();
        int pasta2 = sc.nextInt();
        int pasta3 = sc.nextInt();
        int juice1 = sc.nextInt();
        int juice2 = sc.nextInt();

        int minPasta = Math.min(pasta1, Math.min(pasta2, pasta3));

        int minJuice = Math.min(juice1, juice2);

        int minPrice = minPasta + minJuice - 50;

        System.out.println(minPrice);

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int pasta1 = sc.nextInt();
        int pasta2 = sc.nextInt();
        int pasta3 = sc.nextInt();

        int juice1 = sc.nextInt();
        int juice2 = sc.nextInt();

        int minPasta = Math.min(pasta1, Math.min(pasta2, pasta3));

        int minJuice = Math.min(juice1, juice2);

        int minPrice = minPasta + minJuice - 50;

        System.out.println(minPrice);

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int pasta1 = sc.nextInt();
        int pasta2 = sc.nextInt();
        int pasta3 = sc.nextInt();

        int juice1 = sc.nextInt();
        int juice2 = sc.nextInt();

        int minPasta = Math.min(pasta1, Math.min(pasta2, pasta3));

        int minJuice = Math.min(juice1, juice2);

        int minPrice = minPasta + minJuice - 50;

        System.out.println(minPrice);

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int pasta1 = sc.nextInt();
        int pasta2 = sc.nextInt();
        int pasta3 = sc.nextInt();

        int juice1 = sc.nextInt();
        int juice2 = sc.nextInt();

        int minPasta = Math.min(pasta1, Math.min(pasta2, pasta3));

        int minJuice = Math.min(juice1, juice2);

        int minPrice = minPasta + minJuice - 50;

        System.out.println(minPrice);

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int K = sc.nextInt();

        int[] pasta = new int[N + 1];

        for (int i = 0; i < K; i++) {
            int day = sc.nextInt();
            int type = sc.nextInt();
            pasta[day] = type;
        }

        int[][][] dp = new int[N + 1][4][4];

        if (pasta[1] != 0) {
            dp[1][pasta[1]][0] = 1;
        } else {
            for (int p = 1; p <= 3; p++) {
                dp[1][p][0] = 1;
            }
        }

        for (int day = 2; day <= N; day++) {
            for (int last = 1; last <= 3; last++) {
                for (int secondLast = 0; secondLast <= 3; secondLast++) {
                    if (dp[day - 1][last][secondLast] == 0) continue;

                    if (pasta[day] != 0) {
                        int curr = pasta[day];
                        if (!(last == curr && secondLast == curr)) {
                            dp[day][curr][last] = (dp[day][curr][last] + dp[day - 1][last][secondLast]) % 10000;
                        }
                    } else {
                        for (int curr = 1; curr <= 3; curr++) {
                            if (!(last == curr && secondLast == curr)) {
                                dp[day][curr][last] = (dp[day][curr][last] + dp[day - 1][last][secondLast]) % 10000;
                            }
                        }
                    }
                }
            }
        }

        int result = 0;
        for (int last = 1; last <= 3; last++) {
            for (int secondLast = 0; secondLast <= 3; secondLast++) {
                result = (result + dp[N][last][secondLast]) % 10000;
            }
        }

        System.out.println(result);
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int K = sc.nextInt();

        int[] fixed = new int[N + 1];

        for (int i = 0; i < K; i++) {
            int day = sc.nextInt();
            int pasta = sc.nextInt();
            fixed[day] = pasta;
        }

        int[][][] dp = new int[N + 1][4][4];

        if (fixed[1] != 0) {
            dp[1][fixed[1]][0] = 1;
        } else {
            for (int pasta = 1; pasta <= 3; pasta++) {
                dp[1][pasta][0] = 1;
            }
        }

        for (int day = 2; day <= N; day++) {
            for (int last = 1; last <= 3; last++) {
                for (int secondLast = 0; secondLast <= 3; secondLast++) {
                    if (dp[day - 1][last][secondLast] == 0) continue;

                    if (fixed[day] != 0) {
                        int pasta = fixed[day];
                        if (!(last == pasta && secondLast == pasta)) {
                            dp[day][pasta][last] = (dp[day][pasta][last] + dp[day - 1][last][secondLast]) % 10000;
                        }
                    } else {
                        for (int pasta = 1; pasta <= 3; pasta++) {
                            if (!(last == pasta && secondLast == pasta)) {
                                dp[day][pasta][last] = (dp[day][pasta][last] + dp[day - 1][last][secondLast]) % 10000;
                            }
                        }
                    }
                }
            }
        }

        int result = 0;
        for (int last = 1; last <= 3; last++) {
            for (int secondLast = 0; secondLast <= 3; secondLast++) {
                result = (result + dp[N][last][secondLast]) % 10000;
            }
        }

        System.out.println(result);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int L = sc.nextInt();
        int A = sc.nextInt();
        int B = sc.nextInt();
        int C = sc.nextInt();
        int D = sc.nextInt();

        int japaneseMinDays = (A + C - 1) / C;
        int mathMinDays = (B + D - 1) / D;

        int minHomeworkDays = Math.max(japaneseMinDays, mathMinDays);

        int maxPlayDays = L - minHomeworkDays;

        System.out.println(maxPlayDays);

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int L = sc.nextInt();
        int A = sc.nextInt();
        int B = sc.nextInt();
        int C = sc.nextInt();
        int D = sc.nextInt();

        int japaneseMinDays = (A + C - 1) / C;
        int mathMinDays = (B + D - 1) / D;

        int homeworkDays = Math.max(japaneseMinDays, mathMinDays);

        int playDays = L - homeworkDays;

        System.out.println(playDays);

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int L = sc.nextInt();
        int A = sc.nextInt();
        int B = sc.nextInt();
        int C = sc.nextInt();
        int D = sc.nextInt();

        int daysForA = (A + C - 1) / C;

        int daysForB = (B + D - 1) / D;

        int daysNeeded = Math.max(daysForA, daysForB);

        int daysCanPlay = L - daysNeeded;

        System.out.println(daysCanPlay);

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int L = sc.nextInt();
        int A = sc.nextInt();
        int B = sc.nextInt();
        int C = sc.nextInt();
        int D = sc.nextInt();

        int japanesedays = (A + C - 1) / C;
        int mathDays = (B + D - 1) / D;

        int minWorkDays = Math.max(japanesedays, mathDays);

        int maxPlayDays = L - minWorkDays;

        System.out.println(maxPlayDays);

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int L = sc.nextInt();
        int A = sc.nextInt();
        int B = sc.nextInt();
        int C = sc.nextInt();
        int D = sc.nextInt();

        int daysForA = (A + C - 1) / C;
        int daysForB = (B + D - 1) / D;

        int minWorkDays = Math.max(daysForA, daysForB);

        int playDays = L - minWorkDays;

        System.out.println(playDays);

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int L = sc.nextInt();
        int A = sc.nextInt();
        int B = sc.nextInt();
        int C = sc.nextInt();
        int D = sc.nextInt();

        int daysForKorean = (A + C - 1) / C;
        int daysForMath = (B + D - 1) / D;

        int daysSpentOnHomework = Math.max(daysForKorean, daysForMath);

        int daysToPlay = L - daysSpentOnHomework;

        System.out.println(daysToPlay);

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int L = sc.nextInt();
        int A = sc.nextInt();
        int B = sc.nextInt();
        int C = sc.nextInt();
        int D = sc.nextInt();

        int daysForKorean = (A + C - 1) / C;
        int daysForMath = (B + D - 1) / D;

        int daysNeeded = Math.max(daysForKorean, daysForMath);

        int daysOff = L - daysNeeded;

        System.out.println(daysOff);

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int L = sc.nextInt();
        int A = sc.nextInt();
        int B = sc.nextInt();
        int C = sc.nextInt();
        int D = sc.nextInt();

        int daysForA = (A + C - 1) / C;
        int daysForB = (B + D - 1) / D;

        int totalDaysNeeded = Math.max(daysForA, daysForB);

        int playDays = L - totalDaysNeeded;

        System.out.println(playDays);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int L = sc.nextInt();
        int A = sc.nextInt();
        int B = sc.nextInt();
        int C = sc.nextInt();
        int D = sc.nextInt();

        int daysJapanese = (A + C - 1) / C;
        int daysMath = (B + D - 1) / D;

        int daysHomework = Math.max(daysJapanese, daysMath);

        int daysPlay = L - daysHomework;

        System.out.println(daysPlay);
    }
}

import java.util.Scanner;

public class Homework {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int L = scanner.nextInt();
        int A = scanner.nextInt();
        int B = scanner.nextInt();
        int C = scanner.nextInt();
        int D = scanner.nextInt();

        int daysJapanese = (A + C - 1) / C;
        int daysMath = (B + D - 1) / D;
        int minDays = Math.max(daysJapanese, daysMath);
        int maxPlayDays = L - minDays;

        System.out.println(maxPlayDays);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int L = sc.nextInt();
        int A = sc.nextInt();
        int B = sc.nextInt();
        int C = sc.nextInt();
        int D = sc.nextInt();

        int daysJapanese = (A + C - 1) / C;
        int daysMath = (B + D - 1) / D;
        int maxDays = Math.max(daysJapanese, daysMath);
        int playDays = L - maxDays;

        System.out.println(playDays);
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        int[][] numbers = new int[n][3];
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < 3; j++) {
                numbers[i][j] = sc.nextInt();
            }
        }

        for (int i = 0; i < n; i++) {
            int totalScore = 0;

            for (int game = 0; game < 3; game++) {
                int playerNumber = numbers[i][game];
                boolean isUnique = true;

                for (int j = 0; j < n; j++) {
                    if (i != j && numbers[j][game] == playerNumber) {
                        isUnique = false;
                        break;
                    }
                }

                if (isUnique) {
                    totalScore += playerNumber;
                }
            }

            System.out.println(totalScore);
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        int[][] players = new int[n][3];

        for (int i = 0; i < n; i++) {
            for (int j = 0; j < 3; j++) {
                players[i][j] = sc.nextInt();
            }
        }

        for (int i = 0; i < n; i++) {
            int totalScore = 0;

            for (int game = 0; game < 3; game++) {
                int myNumber = players[i][game];
                boolean isUnique = true;

                for (int j = 0; j < n; j++) {
                    if (i != j && players[j][game] == myNumber) {
                        isUnique = false;
                        break;
                    }
                }

                if (isUnique) {
                    totalScore += myNumber;
                }
            }

            System.out.println(totalScore);
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        int[][] numbers = new int[n][3];
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < 3; j++) {
                numbers[i][j] = sc.nextInt();
            }
        }

        for (int i = 0; i < n; i++) {
            int totalScore = 0;

            for (int game = 0; game < 3; game++) {
                int playerNumber = numbers[i][game];
                boolean isUnique = true;

                for (int j = 0; j < n; j++) {
                    if (i != j && numbers[j][game] == playerNumber) {
                        isUnique = false;
                        break;
                    }
                }

                if (isUnique) {
                    totalScore += playerNumber;
                }
            }

            System.out.println(totalScore);
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        int[][] players = new int[n][3];
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < 3; j++) {
                players[i][j] = sc.nextInt();
            }
        }

        for (int game = 0; game < 3; game++) {
            Map<Integer, Integer> count = new HashMap<>();

            for (int i = 0; i < n; i++) {
                int num = players[i][game];
                count.put(num, count.getOrDefault(num, 0) + 1);
            }

            for (int i = 0; i < n; i++) {
                int num = players[i][game];
                if (count.get(num) == 1) {
                    players[i][game] = num;
                } else {
                    players[i][game] = 0;
                }
            }
        }

        for (int i = 0; i < n; i++) {
            int total = players[i][0] + players[i][1] + players[i][2];
            System.out.println(total);
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        int[][] players = new int[n][3];
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < 3; j++) {
                players[i][j] = sc.nextInt();
            }
        }

        for (int game = 0; game < 3; game++) {
            Map<Integer, Integer> count = new HashMap<>();

            for (int i = 0; i < n; i++) {
                int num = players[i][game];
                count.put(num, count.getOrDefault(num, 0) + 1);
            }

            for (int i = 0; i < n; i++) {
                int num = players[i][game];
                if (count.get(num) == 1) {
                    players[i][game] = num;
                } else {
                    players[i][game] = 0;
                }
            }
        }

        for (int i = 0; i < n; i++) {
            int total = players[i][0] + players[i][1] + players[i][2];
            System.out.println(total);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        String target = sc.next();

        int count = 0;
        for (int i = 0; i < N; i++) {
            String board = sc.next();
            if (canMakeSignboard(board, target)) {
                count++;
            }
        }

        System.out.println(count);
    }

    static boolean canMakeSignboard(String board, String target) {
        int n = board.length();
        int m = target.length();

        for (int start = 0; start < n; start++) {
            for (int interval = 1; start + (m - 1) * interval < n; interval++) {
                boolean match = true;
                for (int j = 0; j < m; j++) {
                    int pos = start + j * interval;
                    if (board.charAt(pos) != target.charAt(j)) {
                        match = false;
                        break;
                    }
                }
                if (match) {
                    return true;
                }
            }
        }

        return false;
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        String target = sc.next();

        int count = 0;
        for (int i = 0; i < N; i++) {
            String board = sc.next();
            if (canMakeSignboard(board, target)) {
                count++;
            }
        }

        System.out.println(count);
    }

    static boolean canMakeSignboard(String board, String target) {
        int n = board.length();
        int m = target.length();

        for (int start = 0; start < n; start++) {
            for (int interval = 1; start + (m - 1) * interval < n; interval++) {
                boolean valid = true;
                for (int i = 0; i < m; i++) {
                    int pos = start + i * interval;
                    if (board.charAt(pos) != target.charAt(i)) {
                        valid = false;
                        break;
                    }
                }
                if (valid) {
                    return true;
                }
            }
        }

        return false;
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        String target = sc.next();

        int count = 0;
        for (int i = 0; i < N; i++) {
            String board = sc.next();
            if (canMakeSignboard(board, target)) {
                count++;
            }
        }

        System.out.println(count);
    }

    static boolean canMakeSignboard(String board, String target) {
        int n = board.length();
        int m = target.length();

        for (int start = 0; start < n; start++) {
            for (int interval = 1; start + (m - 1) * interval < n; interval++) {
                boolean valid = true;
                for (int j = 0; j < m; j++) {
                    int pos = start + j * interval;
                    if (board.charAt(pos) != target.charAt(j)) {
                        valid = false;
                        break;
                    }
                }
                if (valid) {
                    return true;
                }
            }
        }

        return false;
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        String target = sc.next();

        int count = 0;
        for (int i = 0; i < N; i++) {
            String board = sc.next();
            if (canMakeSignboard(board, target)) {
                count++;
            }
        }

        System.out.println(count);
    }

    static boolean canMakeSignboard(String board, String target) {
        int n = board.length();
        int m = target.length();

        for (int start = 0; start < n; start++) {
            for (int interval = 1; start + (m - 1) * interval < n; interval++) {
                boolean valid = true;
                for (int j = 0; j < m; j++) {
                    int pos = start + j * interval;
                    if (board.charAt(pos) != target.charAt(j)) {
                        valid = false;
                        break;
                    }
                }
                if (valid) {
                    return true;
                }
            }
        }

        return false;
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int D = sc.nextInt();
        int N = sc.nextInt();

        int[] T = new int[D];
        for (int i = 0; i < D; i++) {
            T[i] = sc.nextInt();
        }

        int[] A = new int[N];
        int[] B = new int[N];
        int[] C = new int[N];

        for (int i = 0; i < N; i++) {
            A[i] = sc.nextInt();
            B[i] = sc.nextInt();
            C[i] = sc.nextInt();
        }

        List<List<Integer>> suitable = new ArrayList<>();
        for (int day = 0; day < D; day++) {
            suitable.add(new ArrayList<>());
            for (int cloth = 0; cloth < N; cloth++) {
                if (A[cloth] <= T[day] && T[day] <= B[cloth]) {
                    suitable.get(day).add(cloth);
                }
            }
        }

        int[][] dp = new int[D][N];
        for (int i = 0; i < D; i++) {
            Arrays.fill(dp[i], -1);
        }

        for (int cloth : suitable.get(0)) {
            dp[0][cloth] = 0;
        }

        for (int day = 1; day < D; day++) {
            for (int cloth : suitable.get(day)) {
                for (int prevCloth : suitable.get(day - 1)) {
                    if (dp[day - 1][prevCloth] != -1) {
                        int diff = Math.abs(C[cloth] - C[prevCloth]);
                        dp[day][cloth] = Math.max(dp[day][cloth], dp[day - 1][prevCloth] + diff);
                    }
                }
            }
        }

        int result = 0;
        for (int cloth : suitable.get(D - 1)) {
            result = Math.max(result, dp[D - 1][cloth]);
        }

        System.out.println(result);
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int D = sc.nextInt();
        int N = sc.nextInt();

        int[] T = new int[D];
        for (int i = 0; i < D; i++) {
            T[i] = sc.nextInt();
        }

        int[] A = new int[N];
        int[] B = new int[N];
        int[] C = new int[N];
        for (int i = 0; i < N; i++) {
            A[i] = sc.nextInt();
            B[i] = sc.nextInt();
            C[i] = sc.nextInt();
        }

        List<List<Integer>> suitable = new ArrayList<>();
        for (int i = 0; i < D; i++) {
            suitable.add(new ArrayList<>());
            for (int j = 0; j < N; j++) {
                if (A[j] <= T[i] && T[i] <= B[j]) {
                    suitable.get(i).add(j);
                }
            }
        }

        int[][] dp = new int[D][N];
        for (int i = 0; i < D; i++) {
            Arrays.fill(dp[i], -1);
        }

        for (int cloth : suitable.get(0)) {
            dp[0][cloth] = 0;
        }

        for (int day = 1; day < D; day++) {
            for (int cloth : suitable.get(day)) {
                for (int prevCloth : suitable.get(day - 1)) {
                    if (dp[day - 1][prevCloth] != -1) {
                        int diff = Math.abs(C[cloth] - C[prevCloth]);
                        dp[day][cloth] = Math.max(dp[day][cloth], dp[day - 1][prevCloth] + diff);
                    }
                }
            }
        }

        int result = 0;
        for (int cloth : suitable.get(D - 1)) {
            result = Math.max(result, dp[D - 1][cloth]);
        }

        System.out.println(result);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int totalTriangles = 0;
        int rightTriangles = 0;
        int acuteTriangles = 0;
        int obtuseTriangles = 0;

        while (sc.hasNextLine()) {
            String line = sc.nextLine().trim();
            if (line.isEmpty()) break;

            String[] parts = line.split("\\s+");
            if (parts.length != 3) break;

            int a = Integer.parseInt(parts[0]);
            int b = Integer.parseInt(parts[1]);
            int c = Integer.parseInt(parts[2]);

            if (a > b) { int temp = a; a = b; b = temp; }
            if (b > c) { int temp = b; b = c; c = temp; }
            if (a > b) { int temp = a; a = b; b = temp; }

            if (a + b <= c) {
                System.out.println(totalTriangles + " " + rightTriangles + " " + acuteTriangles + " " + obtuseTriangles);
                break;
            }

            totalTriangles++;

            int a2 = a * a;
            int b2 = b * b;
            int c2 = c * c;

            if (a2 + b2 == c2) {
                rightTriangles++;
            } else if (a2 + b2 > c2) {
                acuteTriangles++;
            } else {
                obtuseTriangles++;
            }
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int totalTriangles = 0;
        int rightTriangles = 0;
        int acuteTriangles = 0;
        int obtuseTriangles = 0;

        while (sc.hasNextLine()) {
            String line = sc.nextLine().trim();
            if (line.isEmpty()) break;

            String[] parts = line.split("\\s+");
            if (parts.length != 3) break;

            int a = Integer.parseInt(parts[0]);
            int b = Integer.parseInt(parts[1]);
            int c = Integer.parseInt(parts[2]);

            if (a > b) { int temp = a; a = b; b = temp; }
            if (b > c) { int temp = b; b = c; c = temp; }
            if (a > b) { int temp = a; a = b; b = temp; }

            if (a + b <= c) {
                System.out.println(totalTriangles + " " + rightTriangles + " " + acuteTriangles + " " + obtuseTriangles);
                break;
            }

            totalTriangles++;

            int a2 = a * a;
            int b2 = b * b;
            int c2 = c * c;

            if (a2 + b2 == c2) {
                rightTriangles++;
            } else if (a2 + b2 > c2) {
                acuteTriangles++;
            } else {
                obtuseTriangles++;
            }
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] numbers = new int[n];

        for (int i = 0; i < n; i++) {
            numbers[i] = sc.nextInt();
        }

        int gcd = numbers[0];
        for (int i = 1; i < n; i++) {
            gcd = gcd(gcd, numbers[i]);
        }

        List<Integer> divisors = new ArrayList<>();
        for (int i = 1; i * i <= gcd; i++) {
            if (gcd % i == 0) {
                divisors.add(i);
                if (i != gcd / i) {
                    divisors.add(gcd / i);
                }
            }
        }

        Collections.sort(divisors);
        for (int divisor : divisors) {
            System.out.println(divisor);
        }
    }

    private static int gcd(int a, int b) {
        while (b != 0) {
            int temp = b;
            b = a % b;
            a = temp;
        }
        return a;
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] nums = new int[n];
        for (int i = 0; i < n; i++) {
            nums[i] = sc.nextInt();
        }

        int gcd = nums[0];
        for (int i = 1; i < n; i++) {
            gcd = gcd(gcd, nums[i]);
        }

        List<Integer> divisors = new ArrayList<>();
        for (int i = 1; i * i <= gcd; i++) {
            if (gcd % i == 0) {
                divisors.add(i);
                if (i != gcd / i) {
                    divisors.add(gcd / i);
                }
            }
        }

        Collections.sort(divisors);
        for (int divisor : divisors) {
            System.out.println(divisor);
        }
    }

    private static int gcd(int a, int b) {
        while (b != 0) {
            int temp = b;
            b = a % b;
            a = temp;
        }
        return a;
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] numbers = new int[n];
        for (int i = 0; i < n; i++) {
            numbers[i] = sc.nextInt();
        }

        int gcd = numbers[0];
        for (int i = 1; i < n; i++) {
            gcd = gcd(gcd, numbers[i]);
        }

        List<Integer> divisors = new ArrayList<>();
        for (int i = 1; i * i <= gcd; i++) {
            if (gcd % i == 0) {
                divisors.add(i);
                if (i != gcd / i) {
                    divisors.add(gcd / i);
                }
            }
        }

        Collections.sort(divisors);
        for (int divisor : divisors) {
            System.out.println(divisor);
        }
    }

    private static int gcd(int a, int b) {
        while (b != 0) {
            int temp = b;
            b = a % b;
            a = temp;
        }
        return a;
    }
}

import java.util.*;
import java.io.*;

public class Main {
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

        int n = Integer.parseInt(br.readLine());
        int[] numbers = new int[n];

        for (int i = 0; i < n; i++) {
            numbers[i] = Integer.parseInt(br.readLine());
        }

        List<Long> permutations = new ArrayList<>();

        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                if (i != j) {
                    String concat = String.valueOf(numbers[i]) + String.valueOf(numbers[j]);
                    permutations.add(Long.parseLong(concat));
                }
            }
        }

        Collections.sort(permutations);

        System.out.println(permutations.get(2));
    }
}

import java.util.*;
import java.io.*;

public class Main {
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        int n = Integer.parseInt(br.readLine());

        int[] nums = new int[n];
        for (int i = 0; i < n; i++) {
            nums[i] = Integer.parseInt(br.readLine());
        }

        List<Long> permutations = new ArrayList<>();

        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                if (i != j) {
                    String concat = String.valueOf(nums[i]) + String.valueOf(nums[j]);
                    permutations.add(Long.parseLong(concat));
                }
            }
        }

        Collections.sort(permutations);
        System.out.println(permutations.get(2));
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        int m = sc.nextInt();

        int currentCars = m;
        int maxCars = m;

        for (int i = 0; i < n; i++) {
            int enter = sc.nextInt();
            int exit = sc.nextInt();

            currentCars = currentCars + enter - exit;

            if (currentCars < 0) {
                System.out.println(0);
                return;
            }

            maxCars = Math.max(maxCars, currentCars);
        }

        System.out.println(maxCars);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        int m = sc.nextInt();

        int currentCars = m;
        int maxCars = m;

        for (int i = 0; i < n; i++) {
            int enter = sc.nextInt();
            int exit = sc.nextInt();

            currentCars = currentCars + enter - exit;

            if (currentCars < 0) {
                System.out.println(0);
                return;
            }

            maxCars = Math.max(maxCars, currentCars);
        }

        System.out.println(maxCars);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        int m = sc.nextInt();

        int current = m;
        int max = m;

        for (int i = 0; i < n; i++) {
            int enter = sc.nextInt();
            int exit = sc.nextInt();

            current = current + enter - exit;

            if (current < 0) {
                System.out.println(0);
                return;
            }

            max = Math.max(max, current);
        }

        System.out.println(max);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        int m = sc.nextInt();

        int currentCars = m;
        int maxCars = m;

        for (int i = 0; i < n; i++) {
            int enter = sc.nextInt();
            int exit = sc.nextInt();

            currentCars = currentCars + enter - exit;

            if (currentCars < 0) {
                System.out.println(0);
                return;
            }

            if (currentCars > maxCars) {
                maxCars = currentCars;
            }
        }

        System.out.println(maxCars);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        int m = scanner.nextInt();
        int current = m;
        int max = current;

        for (int i = 0; i < n; i++) {
            int in = scanner.nextInt();
            int out = scanner.nextInt();
            current = current + in - out;

            if (current < 0) {
                System.out.println(0);
                return;
            }

            if (current > max) {
                max = current;
            }
        }

        System.out.println(max);
    }
}

import java.util.Scanner;

public class Calculator {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        int result = scanner.nextInt();

        while (scanner.hasNext()) {
            String operator = scanner.next();

            if (operator.equals("=")) {
                break;
            }

            int operand = scanner.nextInt();

            switch (operator) {
                case "+":
                    result += operand;
                    break;
                case "-":
                    result -= operand;
                    break;
                case "*":
                    result *= operand;
                    break;
                case "/":
                    result /= operand;
                    break;
            }
        }

        System.out.println(result);
        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int result = sc.nextInt();

        while (sc.hasNext()) {
            String operator = sc.next();

            if (operator.equals("=")) {
                break;
            }

            int operand = sc.nextInt();

            switch (operator) {
                case "+":
                    result += operand;
                    break;
                case "-":
                    result -= operand;
                    break;
                case "*":
                    result *= operand;
                    break;
                case "/":
                    result /= operand;
                    break;
            }
        }

        System.out.println(result);
        sc.close();
    }
}

import java.util.Scanner;

public class Calculator {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        int result = scanner.nextInt();

        while (scanner.hasNext()) {
            String operator = scanner.next();

            if (operator.equals("=")) {
                break;
            }

            int operand = scanner.nextInt();

            switch (operator) {
                case "+":
                    result += operand;
                    break;
                case "-":
                    result -= operand;
                    break;
                case "*":
                    result *= operand;
                    break;
                case "/":
                    result /= operand;
                    break;
            }
        }

        System.out.println(result);
        scanner.close();
    }
}

import java.util.Scanner;

public class Calculator {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        int result = scanner.nextInt();

        while (scanner.hasNext()) {
            String operator = scanner.next();

            if (operator.equals("=")) {
                break;
            }

            int operand = scanner.nextInt();

            switch (operator) {
                case "+":
                    result += operand;
                    break;
                case "-":
                    result -= operand;
                    break;
                case "*":
                    result *= operand;
                    break;
                case "/":
                    result /= operand;
                    break;
            }
        }

        System.out.println(result);
        scanner.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        Map<String, Integer> orders = new HashMap<>();

        for (int i = 0; i < n; i++) {
            String product = sc.next();
            int quantity = sc.nextInt();
            orders.put(product, orders.getOrDefault(product, 0) + quantity);
        }

        List<String> products = new ArrayList<>(orders.keySet());

        products.sort((a, b) -> {
            if (a.length() != b.length()) {
                return a.length() - b.length();
            }
            return a.compareTo(b);
        });

        for (String product : products) {
            System.out.println(product + " " + orders.get(product));
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        Map<String, Integer> productMap = new HashMap<>();

        for (int i = 0; i < n; i++) {
            String product = sc.next();
            int quantity = sc.nextInt();
            productMap.put(product, productMap.getOrDefault(product, 0) + quantity);
        }

        List<String> products = new ArrayList<>(productMap.keySet());

        products.sort((a, b) -> {
            if (a.length() != b.length()) {
                return a.length() - b.length();
            }
            return a.compareTo(b);
        });

        for (String product : products) {
            System.out.println(product + " " + productMap.get(product));
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int sum = 0;
        for (int i = 0; i < 5; i++) {
            int score = sc.nextInt();
            sum += Math.max(score, 40);
        }

        System.out.println(sum / 5);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int total = 0;
        for (int i = 0; i < 5; i++) {
            int score = sc.nextInt();
            total += Math.max(score, 40);
        }

        System.out.println(total / 5);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int totalScore = 0;
        for (int i = 0; i < 5; i++) {
            int score = sc.nextInt();
            totalScore += Math.max(score, 40);
        }
        System.out.println(totalScore / 5);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int totalScore = 0;
        for (int i = 0; i < 5; i++) {
            int score = sc.nextInt();
            totalScore += Math.max(score, 40);
        }
        System.out.println(totalScore / 5);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int sum = 0;
        for (int i = 0; i < 5; i++) {
            int score = sc.nextInt();
            sum += Math.max(score, 40);
        }

        System.out.println(sum / 5);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int sum = 0;
        for (int i = 0; i < 5; i++) {
            int score = sc.nextInt();
            sum += Math.max(score, 40);
        }

        System.out.println(sum / 5);
        sc.close();
    }
}

import java.util.Scanner;

public class Vote {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int N = sc.nextInt();
        int M = sc.nextInt();

        int[] A = new int[N];
        for (int i = 0; i < N; i++) {
            A[i] = sc.nextInt();
        }

        int[] votes = new int[N];

        for (int j = 0; j < M; j++) {
            int B = sc.nextInt();

            for (int i = 0; i < N; i++) {
                if (A[i] <= B) {
                    votes[i]++;
                    break;
                }
            }
        }

        int maxVotes = 0;
        int winner = 0;
        for (int i = 0; i < N; i++) {
            if (votes[i] > maxVotes) {
                maxVotes = votes[i];
                winner = i + 1;
            }
        }

        System.out.println(winner);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int N = sc.nextInt();
        int M = sc.nextInt();

        int[] A = new int[N];
        for (int i = 0; i < N; i++) {
            A[i] = sc.nextInt();
        }

        int[] votes = new int[N];

        for (int j = 0; j < M; j++) {
            int B = sc.nextInt();

            for (int i = 0; i < N; i++) {
                if (A[i] <= B) {
                    votes[i]++;
                    break;
                }
            }
        }

        int maxVotes = 0;
        int winnerSport = 1;
        for (int i = 0; i < N; i++) {
            if (votes[i] > maxVotes) {
                maxVotes = votes[i];
                winnerSport = i + 1;
            }
        }

        System.out.println(winnerSport);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int W = sc.nextInt();
        int H = sc.nextInt();
        int N = sc.nextInt();

        int totalDistance = 0;
        int currentX = sc.nextInt();
        int currentY = sc.nextInt();

        for (int i = 1; i < N; i++) {
            int nextX = sc.nextInt();
            int nextY = sc.nextInt();

            int dx = Math.abs(nextX - currentX);
            int dy = Math.abs(nextY - currentY);

            totalDistance += Math.max(dx, dy);

            currentX = nextX;
            currentY = nextY;
        }

        System.out.println(totalDistance);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int W = sc.nextInt();
        int H = sc.nextInt();
        int N = sc.nextInt();

        int totalDistance = 0;
        int prevX = sc.nextInt();
        int prevY = sc.nextInt();

        for (int i = 1; i < N; i++) {
            int x = sc.nextInt();
            int y = sc.nextInt();

            int dx = Math.abs(x - prevX);
            int dy = Math.abs(y - prevY);

            totalDistance += Math.max(dx, dy);

            prevX = x;
            prevY = y;
        }

        System.out.println(totalDistance);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int W = sc.nextInt();
        int H = sc.nextInt();
        int N = sc.nextInt();

        int totalDistance = 0;
        int prevX = sc.nextInt();
        int prevY = sc.nextInt();

        for (int i = 1; i < N; i++) {
            int currX = sc.nextInt();
            int currY = sc.nextInt();

            int dx = Math.abs(currX - prevX);
            int dy = Math.abs(currY - prevY);

            totalDistance += Math.max(dx, dy);

            prevX = currX;
            prevY = currY;
        }

        System.out.println(totalDistance);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int A = sc.nextInt();
        int B = sc.nextInt();
        int C = sc.nextInt();
        int D = sc.nextInt();
        int P = sc.nextInt();

        int costX = A * P;

        int costY;
        if (P <= C) {
            costY = B;
        } else {
            costY = B + D * (P - C);
        }

        int minCost = Math.min(costX, costY);

        System.out.println(minCost);

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int A = sc.nextInt();
        int B = sc.nextInt();
        int C = sc.nextInt();
        int D = sc.nextInt();
        int P = sc.nextInt();

        int costX = A * P;

        int costY;
        if (P <= C) {
            costY = B;
        } else {
            costY = B + D * (P - C);
        }

        int minCost = Math.min(costX, costY);

        System.out.println(minCost);

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int A = sc.nextInt();
        int B = sc.nextInt();
        int C = sc.nextInt();
        int D = sc.nextInt();
        int P = sc.nextInt();

        int costX = A * P;

        int costY;
        if (P <= C) {
            costY = B;
        } else {
            costY = B + D * (P - C);
        }

        int minCost = Math.min(costX, costY);

        System.out.println(minCost);

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int A = sc.nextInt();
        int B = sc.nextInt();
        int C = sc.nextInt();
        int D = sc.nextInt();
        int P = sc.nextInt();

        int costX = A * P;

        int costY;
        if (P <= C) {
            costY = B;
        } else {
            costY = B + D * (P - C);
        }

        System.out.println(Math.min(costX, costY));

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int A = sc.nextInt();
        int B = sc.nextInt();
        int C = sc.nextInt();
        int D = sc.nextInt();
        int P = sc.nextInt();

        int costX = A * P;

        int costY;
        if (P <= C) {
            costY = B;
        } else {
            costY = B + D * (P - C);
        }

        System.out.println(Math.min(costX, costY));

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int N = sc.nextInt();
        int M = sc.nextInt();

        int[] targets = new int[M];
        for (int i = 0; i < M; i++) {
            targets[i] = sc.nextInt();
        }

        int[][] guesses = new int[M][N];
        for (int i = 0; i < M; i++) {
            for (int j = 0; j < N; j++) {
                guesses[i][j] = sc.nextInt();
            }
        }

        int[] scores = new int[N];

        for (int game = 0; game < M; game++) {
            int target = targets[game];
            int wrongGuesses = 0;

            for (int person = 0; person < N; person++) {
                if (guesses[game][person] == target) {
                    scores[person]++;
                } else {
                    wrongGuesses++;
                }
            }

            scores[target - 1] += wrongGuesses;
        }

        for (int i = 0; i < N; i++) {
            System.out.println(scores[i]);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class ChristmasParty {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int N = sc.nextInt();
        int M = sc.nextInt();

        int[] targets = new int[M];
        for (int i = 0; i < M; i++) {
            targets[i] = sc.nextInt();
        }

        int[][] guesses = new int[M][N];
        for (int i = 0; i < M; i++) {
            for (int j = 0; j < N; j++) {
                guesses[i][j] = sc.nextInt();
            }
        }

        int[] scores = new int[N];

        for (int game = 0; game < M; game++) {
            int target = targets[game];
            int wrongGuesses = 0;

            for (int friend = 0; friend < N; friend++) {
                if (guesses[game][friend] == target) {
                    scores[friend]++;
                } else {
                    wrongGuesses++;
                }
            }

            scores[target - 1] += wrongGuesses;
        }

        for (int i = 0; i < N; i++) {
            System.out.println(scores[i]);
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int A = sc.nextInt();
        int B = sc.nextInt();
        int C = sc.nextInt();
        int D = sc.nextInt();
        int E = sc.nextInt();
        int F = sc.nextInt();

        int[] science = {A, B, C, D};
        Arrays.sort(science);
        int scienceSum = science[1] + science[2] + science[3];

        int socialMax = Math.max(E, F);

        System.out.println(scienceSum + socialMax);
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int A = sc.nextInt();
        int B = sc.nextInt();
        int C = sc.nextInt();
        int D = sc.nextInt();
        int E = sc.nextInt();
        int F = sc.nextInt();

        int[] science = {A, B, C, D};
        Arrays.sort(science);
        int scienceSum = science[3] + science[2] + science[1];

        int socialSum = Math.max(E, F);

        System.out.println(scienceSum + socialSum);
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int A = scanner.nextInt();
        int B = scanner.nextInt();
        int C = scanner.nextInt();
        int D = scanner.nextInt();
        int E = scanner.nextInt();
        int F = scanner.nextInt();

        int[] sciences = {A, B, C, D};
        Arrays.sort(sciences);
        int scienceSum = sciences[1] + sciences[2] + sciences[3];

        int socialSum = Math.max(E, F);

        System.out.println(scienceSum + socialSum);
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int A = sc.nextInt();
        int B = sc.nextInt();
        int C = sc.nextInt();
        int D = sc.nextInt();
        int E = sc.nextInt();
        int F = sc.nextInt();

        int[] sciences = {A, B, C, D};
        Arrays.sort(sciences);
        int scienceSum = sciences[3] + sciences[2] + sciences[1];

        int socialSum = Math.max(E, F);

        System.out.println(scienceSum + socialSum);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int A = sc.nextInt();
        int B = sc.nextInt();
        int C = sc.nextInt();
        int D = sc.nextInt();
        int E = sc.nextInt();

        int totalTime = 0;

        if (A < 0) {
            totalTime += C * (0 - A);
            totalTime += D;
            totalTime += E * B;
        } else {
            totalTime += E * (B - A);
        }

        System.out.println(totalTime);
        sc.close();
    }
}

import java.util.Scanner;

public class Microwave {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int A = sc.nextInt();
        int B = sc.nextInt();
        int C = sc.nextInt();
        int D = sc.nextInt();
        int E = sc.nextInt();

        int totalTime = 0;

        if (A < 0) {
            totalTime += C * (0 - A);
            totalTime += D;
            totalTime += E * B;
        } else {
            totalTime += E * (B - A);
        }

        System.out.println(totalTime);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int A = sc.nextInt();
        int B = sc.nextInt();
        int C = sc.nextInt();
        int D = sc.nextInt();
        int E = sc.nextInt();

        int totalTime = 0;

        if (A < 0) {
            totalTime += C * (0 - A);
            totalTime += D;
            totalTime += E * B;
        } else {
            totalTime += E * (B - A);
        }

        System.out.println(totalTime);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int A = sc.nextInt();
        int B = sc.nextInt();
        int C = sc.nextInt();
        int D = sc.nextInt();
        int E = sc.nextInt();

        int totalTime = 0;

        if (A < 0) {
            totalTime += C * (0 - A);
            totalTime += D;
            totalTime += E * B;
        } else {
            totalTime += E * (B - A);
        }

        System.out.println(totalTime);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int A = sc.nextInt();
        int B = sc.nextInt();
        int C = sc.nextInt();
        int D = sc.nextInt();
        int E = sc.nextInt();

        int totalTime = 0;

        if (A < 0) {
            totalTime += C * (0 - A);
            totalTime += D;
            totalTime += E * B;
        } else {
            totalTime += E * (B - A);
        }

        System.out.println(totalTime);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int A = sc.nextInt();
        int B = sc.nextInt();
        int C = sc.nextInt();
        int D = sc.nextInt();

        int setsX = (N + A - 1) / A;
        int costX = setsX * B;

        int setsY = (N + C - 1) / C;
        int costY = setsY * D;

        System.out.println(Math.min(costX, costY));

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int N = sc.nextInt();
        int A = sc.nextInt();
        int B = sc.nextInt();
        int C = sc.nextInt();
        int D = sc.nextInt();

        int setXCount = (N + A - 1) / A;
        int costX = setXCount * B;

        int setYCount = (N + C - 1) / C;
        int costY = setYCount * D;

        System.out.println(Math.min(costX, costY));

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int N = sc.nextInt();
        int A = sc.nextInt();
        int B = sc.nextInt();
        int C = sc.nextInt();
        int D = sc.nextInt();

        int setsX = (N + A - 1) / A;
        int costX = setsX * B;

        int setsY = (N + C - 1) / C;
        int costY = setsY * D;

        System.out.println(Math.min(costX, costY));

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        int a = sc.nextInt();
        int b = sc.nextInt();
        int c = sc.nextInt();
        int d = sc.nextInt();

        int setsX = (n + a - 1) / a;
        int costX = setsX * b;

        int setsY = (n + c - 1) / c;
        int costY = setsY * d;

        System.out.println(Math.min(costX, costY));

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int A = sc.nextInt();
        int B = sc.nextInt();
        int C = sc.nextInt();
        int D = sc.nextInt();

        int setsX = (N + A - 1) / A;
        int costX = setsX * B;

        int setsY = (N + C - 1) / C;
        int costY = setsY * D;

        System.out.println(Math.min(costX, costY));
    }
}

import java.util.Scanner;

public class Pencils {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int A = sc.nextInt();
        int B = sc.nextInt();
        int C = sc.nextInt();
        int D = sc.nextInt();

        int xCount = (N + A - 1) / A;
        int xCost = xCount * B;

        int yCount = (N + C - 1) / C;
        int yCost = yCount * D;

        System.out.println(Math.min(xCost, yCost));
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int A = sc.nextInt();
        int B = sc.nextInt();
        int C = sc.nextInt();
        int D = sc.nextInt();

        int setsX = (N + A - 1) / A;
        int costX = setsX * B;

        int setsY = (N + C - 1) / C;
        int costY = setsY * D;

        System.out.println(Math.min(costX, costY));
    }
}

import java.util.Scanner;

public class Pencils {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int N = scanner.nextInt();
        int A = scanner.nextInt();
        int B = scanner.nextInt();
        int C = scanner.nextInt();
        int D = scanner.nextInt();

        int xSets = (N + A - 1) / A;
        int xCost = xSets * B;

        int ySets = (N + C - 1) / C;
        int yCost = ySets * D;

        System.out.println(Math.min(xCost, yCost));
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int A = sc.nextInt();
        int B = sc.nextInt();
        int C = sc.nextInt();
        int D = sc.nextInt();

        int needX = (N + A - 1) / A;
        int costX = needX * B;

        int needY = (N + C - 1) / C;
        int costY = needY * D;

        System.out.println(Math.min(costX, costY));
    }
}

import java.util.Scanner;

public class Pencils {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int N = scanner.nextInt();
        int A = scanner.nextInt();
        int B = scanner.nextInt();
        int C = scanner.nextInt();
        int D = scanner.nextInt();

        int xSets = (N + A - 1) / A;
        int xCost = xSets * B;

        int ySets = (N + C - 1) / C;
        int yCost = ySets * D;

        System.out.println(Math.min(xCost, yCost));
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        while (sc.hasNextInt()) {
            int a = sc.nextInt();
            int b = sc.nextInt();
            System.out.println(a + b);
        }
        sc.close();
    }
}

import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        while (sc.hasNext()) {
            int a = sc.nextInt();
            int b = sc.nextInt();
            System.out.println(a + b);
        }
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        while (sc.hasNextInt()) {
            int a = sc.nextInt();
            int b = sc.nextInt();
            System.out.println(a + b);
        }
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        while (sc.hasNextInt()) {
            int a = sc.nextInt();
            int b = sc.nextInt();
            System.out.println(a + b);
        }
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        while (scanner.hasNextInt()) {
            int a = scanner.nextInt();
            int b = scanner.nextInt();
            System.out.println(a + b);
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        while (scanner.hasNextInt()) {
            int a = scanner.nextInt();
            int b = scanner.nextInt();
            System.out.println(a + b);
        }
        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        while (sc.hasNextInt()) {
            int a = sc.nextInt();
            int b = sc.nextInt();
            System.out.println(a + b);
        }
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        while (sc.hasNextInt()) {
            int a = sc.nextInt();
            int b = sc.nextInt();
            System.out.println(a + b);
        }
        sc.close();
    }
}

import java.util.Scanner;

public class PairOfPrimes {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (sc.hasNextInt()) {
            int n = sc.nextInt();
            System.out.println(countPrimePairs(n));
        }

        sc.close();
    }

    static int countPrimePairs(int n) {
        boolean[] isPrime = sieveOfEratosthenes(n);
        int count = 0;

        for (int i = 1; i <= n; i++) {
            int paired = n + 1 - i;
            if (isPrime[i] && isPrime[paired]) {
                count++;
            }
        }

        return count;
    }

    static boolean[] sieveOfEratosthenes(int n) {
        boolean[] isPrime = new boolean[n + 1];

        for (int i = 2; i <= n; i++) {
            isPrime[i] = true;
        }

        for (int i = 2; i * i <= n; i++) {
            if (isPrime[i]) {
                for (int j = i * i; j <= n; j += i) {
                    isPrime[j] = false;
                }
            }
        }

        return isPrime;
    }
}

import java.util.Scanner;

public class PairOfPrimes {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (sc.hasNextInt()) {
            int n = sc.nextInt();
            System.out.println(countPrimePairs(n));
        }

        sc.close();
    }

    static int countPrimePairs(int n) {
        boolean[] isPrime = sieveOfEratosthenes(n);
        int count = 0;

        for (int i = 1; i <= n; i++) {
            int paired = n + 1 - i;
            if (isPrime[i] && isPrime[paired]) {
                count++;
            }
        }

        return count;
    }

    static boolean[] sieveOfEratosthenes(int n) {
        boolean[] isPrime = new boolean[n + 1];

        for (int i = 2; i <= n; i++) {
            isPrime[i] = true;
        }

        for (int i = 2; i * i <= n; i++) {
            if (isPrime[i]) {
                for (int j = i * i; j <= n; j += i) {
                    isPrime[j] = false;
                }
            }
        }

        return isPrime;
    }
}

import java.util.Scanner;

public class Solution {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            if (n == 0) break;

            int[][] matrix = new int[n][n];
            for (int i = 0; i < n; i++) {
                for (int j = 0; j < n; j++) {
                    matrix[i][j] = sc.nextInt();
                }
            }

            int[] rowMin = new int[n];
            for (int i = 0; i < n; i++) {
                rowMin[i] = matrix[i][0];
                for (int j = 1; j < n; j++) {
                    if (matrix[i][j] < rowMin[i]) {
                        rowMin[i] = matrix[i][j];
                    }
                }
            }

            int[] colMax = new int[n];
            for (int j = 0; j < n; j++) {
                colMax[j] = matrix[0][j];
                for (int i = 1; i < n; i++) {
                    if (matrix[i][j] > colMax[j]) {
                        colMax[j] = matrix[i][j];
                    }
                }
            }

            int result = 0;
            for (int i = 0; i < n; i++) {
                for (int j = 0; j < n; j++) {
                    if (matrix[i][j] == rowMin[i] && matrix[i][j] == colMax[j]) {
                        result = matrix[i][j];
                        break;
                    }
                }
                if (result != 0) break;
            }

            System.out.println(result);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            if (n == 0) break;

            int[][] matrix = new int[n][n];
            for (int i = 0; i < n; i++) {
                for (int j = 0; j < n; j++) {
                    matrix[i][j] = sc.nextInt();
                }
            }

            int[] rowMins = new int[n];
            for (int i = 0; i < n; i++) {
                rowMins[i] = matrix[i][0];
                for (int j = 1; j < n; j++) {
                    if (matrix[i][j] < rowMins[i]) {
                        rowMins[i] = matrix[i][j];
                    }
                }
            }

            int[] colMaxs = new int[n];
            for (int j = 0; j < n; j++) {
                colMaxs[j] = matrix[0][j];
                for (int i = 1; i < n; i++) {
                    if (matrix[i][j] > colMaxs[j]) {
                        colMaxs[j] = matrix[i][j];
                    }
                }
            }

            int result = 0;
            for (int i = 0; i < n; i++) {
                for (int j = 0; j < n; j++) {
                    if (matrix[i][j] == rowMins[i] && matrix[i][j] == colMaxs[j]) {
                        result = matrix[i][j];
                        break;
                    }
                }
                if (result != 0) break;
            }

            System.out.println(result);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Solution {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            if (n == 0) break;

            int[][] matrix = new int[n][n];
            for (int i = 0; i < n; i++) {
                for (int j = 0; j < n; j++) {
                    matrix[i][j] = sc.nextInt();
                }
            }

            int[] rowMins = new int[n];
            for (int i = 0; i < n; i++) {
                rowMins[i] = matrix[i][0];
                for (int j = 1; j < n; j++) {
                    if (matrix[i][j] < rowMins[i]) {
                        rowMins[i] = matrix[i][j];
                    }
                }
            }

            int[] colMaxs = new int[n];
            for (int j = 0; j < n; j++) {
                colMaxs[j] = matrix[0][j];
                for (int i = 1; i < n; i++) {
                    if (matrix[i][j] > colMaxs[j]) {
                        colMaxs[j] = matrix[i][j];
                    }
                }
            }

            int result = 0;
            for (int i = 0; i < n; i++) {
                for (int j = 0; j < n; j++) {
                    if (matrix[i][j] == rowMins[i] && matrix[i][j] == colMaxs[j]) {
                        result = matrix[i][j];
                        break;
                    }
                }
                if (result != 0) break;
            }

            System.out.println(result);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Solution {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            if (n == 0) break;

            int[][] matrix = new int[n][n];
            for (int i = 0; i < n; i++) {
                for (int j = 0; j < n; j++) {
                    matrix[i][j] = sc.nextInt();
                }
            }

            int[] rowMin = new int[n];
            for (int i = 0; i < n; i++) {
                rowMin[i] = matrix[i][0];
                for (int j = 1; j < n; j++) {
                    if (matrix[i][j] < rowMin[i]) {
                        rowMin[i] = matrix[i][j];
                    }
                }
            }

            int[] colMax = new int[n];
            for (int j = 0; j < n; j++) {
                colMax[j] = matrix[0][j];
                for (int i = 1; i < n; i++) {
                    if (matrix[i][j] > colMax[j]) {
                        colMax[j] = matrix[i][j];
                    }
                }
            }

            int result = 0;
            for (int i = 0; i < n; i++) {
                for (int j = 0; j < n; j++) {
                    if (matrix[i][j] == rowMin[i] && matrix[i][j] == colMax[j]) {
                        result = matrix[i][j];
                        break;
                    }
                }
                if (result != 0) break;
            }

            System.out.println(result);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class AdvancedAlgorithmClass {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        while (true) {
            int n = scanner.nextInt();
            if (n == 0) break;

            int[][] matrix = new int[n][n];
            for (int i = 0; i < n; i++) {
                for (int j = 0; j < n; j++) {
                    matrix[i][j] = scanner.nextInt();
                }
            }

            int[] rowMins = new int[n];
            for (int i = 0; i < n; i++) {
                int min = matrix[i][0];
                for (int j = 1; j < n; j++) {
                    if (matrix[i][j] < min) {
                        min = matrix[i][j];
                    }
                }
                rowMins[i] = min;
            }

            int[] colMaxs = new int[n];
            for (int j = 0; j < n; j++) {
                int max = matrix[0][j];
                for (int i = 1; i < n; i++) {
                    if (matrix[i][j] > max) {
                        max = matrix[i][j];
                    }
                }
                colMaxs[j] = max;
            }

            int result = 0;
            for (int i = 0; i < n; i++) {
                for (int j = 0; j < n; j++) {
                    if (matrix[i][j] == rowMins[i] && matrix[i][j] == colMaxs[j]) {
                        result = matrix[i][j];
                        break;
                    }
                }
                if (result != 0) break;
            }

            System.out.println(result);
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class AdvancedAlgorithmClass {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        while (true) {
            int n = scanner.nextInt();
            if (n == 0) break;

            int[][] matrix = new int[n][n];
            for (int i = 0; i < n; i++) {
                for (int j = 0; j < n; j++) {
                    matrix[i][j] = scanner.nextInt();
                }
            }

            int[] rowMin = new int[n];
            for (int i = 0; i < n; i++) {
                int min = matrix[i][0];
                for (int j = 1; j < n; j++) {
                    if (matrix[i][j] < min) {
                        min = matrix[i][j];
                    }
                }
                rowMin[i] = min;
            }

            int[] colMax = new int[n];
            for (int j = 0; j < n; j++) {
                int max = matrix[0][j];
                for (int i = 1; i < n; i++) {
                    if (matrix[i][j] > max) {
                        max = matrix[i][j];
                    }
                }
                colMax[j] = max;
            }

            int result = 0;
            for (int i = 0; i < n; i++) {
                for (int j = 0; j < n; j++) {
                    if (matrix[i][j] == rowMin[i] && matrix[i][j] == colMax[j]) {
                        result = matrix[i][j];
                        break;
                    }
                }
                if (result != 0) break;
            }
            System.out.println(result);
        }
        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int caseNum = 1;

        while (true) {
            int n = sc.nextInt();
            if (n == 0) break;

            int[][] matrix = new int[n][n];
            int count = 1;

            for (int sum = 0; sum < 2 * n - 1; sum++) {
                if (sum % 2 == 0) {
                    for (int i = Math.min(sum, n - 1); i >= Math.max(0, sum - n + 1); i--) {
                        int j = sum - i;
                        matrix[i][j] = count++;
                    }
                } else {
                    for (int i = Math.max(0, sum - n + 1); i <= Math.min(sum, n - 1); i++) {
                        int j = sum - i;
                        matrix[i][j] = count++;
                    }
                }
            }

            System.out.println("Case " + caseNum + ":");
            for (int i = 0; i < n; i++) {
                for (int j = 0; j < n; j++) {
                    System.out.printf("%3d", matrix[i][j]);
                }
                System.out.println();
            }

            caseNum++;
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int caseNum = 1;

        while (true) {
            int n = sc.nextInt();
            if (n == 0) break;

            int[][] matrix = new int[n][n];
            int count = 1;

            for (int sum = 0; sum < 2 * n - 1; sum++) {
                if (sum % 2 == 0) {
                    for (int i = Math.min(sum, n - 1); i >= Math.max(0, sum - n + 1); i--) {
                        int j = sum - i;
                        matrix[i][j] = count++;
                    }
                } else {
                    for (int i = Math.max(0, sum - n + 1); i <= Math.min(sum, n - 1); i++) {
                        int j = sum - i;
                        matrix[i][j] = count++;
                    }
                }
            }

            System.out.println("Case " + caseNum + ":");
            for (int i = 0; i < n; i++) {
                for (int j = 0; j < n; j++) {
                    System.out.printf("%3d", matrix[i][j]);
                }
                System.out.println();
            }
            caseNum++;
        }
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int caseNum = 1;

        while (true) {
            int n = sc.nextInt();
            if (n == 0) break;

            int[][] matrix = new int[n][n];
            int count = 1;
            int row = 0, col = 0;
            boolean goingUp = true;

            for (int i = 0; i < n * n; i++) {
                matrix[row][col] = count++;

                if (goingUp) {
                    if (row == 0 || col == n - 1) {
                        goingUp = false;
                        if (col == n - 1) {
                            row++;
                        } else {
                            col++;
                        }
                    } else {
                        row--;
                        col++;
                    }
                } else {
                    if (col == 0 || row == n - 1) {
                        goingUp = true;
                        if (row == n - 1) {
                            col++;
                        } else {
                            row++;
                        }
                    } else {
                        row++;
                        col--;
                    }
                }
            }

            System.out.println("Case " + caseNum + ":");
            for (int i = 0; i < n; i++) {
                for (int j = 0; j < n; j++) {
                    System.out.printf("%3d", matrix[i][j]);
                }
                System.out.println();
            }
            caseNum++;
        }
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int caseNum = 1;

        while (true) {
            int n = sc.nextInt();
            if (n == 0) break;

            int[][] matrix = new int[n][n];
            int count = 1;
            int row = 0, col = 0;
            boolean goingUp = true;

            for (int i = 0; i < n * n; i++) {
                matrix[row][col] = count++;

                if (goingUp) {
                    if (row == 0 || col == n - 1) {
                        goingUp = false;
                        if (col == n - 1) {
                            row++;
                        } else {
                            col++;
                        }
                    } else {
                        row--;
                        col++;
                    }
                } else {
                    if (col == 0 || row == n - 1) {
                        goingUp = true;
                        if (row == n - 1) {
                            col++;
                        } else {
                            row++;
                        }
                    } else {
                        row++;
                        col--;
                    }
                }
            }

            System.out.println("Case " + caseNum + ":");
            for (int i = 0; i < n; i++) {
                for (int j = 0; j < n; j++) {
                    System.out.printf("%3d", matrix[i][j]);
                }
                System.out.println();
            }
            caseNum++;
        }
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        while (scanner.hasNextLine()) {
            String line = scanner.nextLine().trim();
            if (line.isEmpty()) break;

            String[] parts = line.split("\\s+");
            int a = Integer.parseInt(parts[0]);
            int b = Integer.parseInt(parts[1]);

            System.out.println(gcd(a, b));
        }

        scanner.close();
    }

    private static int gcd(int a, int b) {
        while (b != 0) {
            int temp = b;
            b = a % b;
            a = temp;
        }
        return a;
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        while (scanner.hasNextLine()) {
            String line = scanner.nextLine().trim();
            if (line.isEmpty()) break;

            String[] parts = line.split("\\s+");
            int a = Integer.parseInt(parts[0]);
            int b = Integer.parseInt(parts[1]);

            System.out.println(gcd(a, b));
        }

        scanner.close();
    }

    private static int gcd(int a, int b) {
        while (b != 0) {
            int temp = b;
            b = a % b;
            a = temp;
        }
        return a;
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        while (scanner.hasNextLine()) {
            String line = scanner.nextLine().trim();
            if (line.isEmpty()) break;

            String[] numbers = line.split("\\s+");
            int a = Integer.parseInt(numbers[0]);
            int b = Integer.parseInt(numbers[1]);

            System.out.println(gcd(a, b));
        }

        scanner.close();
    }

    private static int gcd(int a, int b) {
        while (b != 0) {
            int temp = b;
            b = a % b;
            a = temp;
        }
        return a;
    }
}

import java.util.*;
import java.io.*;

public class Main {
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        String line;

        while ((line = br.readLine()) != null) {
            int n = Integer.parseInt(line.trim());
            if (n == 0) continue;

            int[] times = new int[n];
            String[] parts = br.readLine().trim().split("\\s+");
            for (int i = 0; i < n; i++) {
                times[i] = Integer.parseInt(parts[i]);
            }

            Arrays.sort(times);

            long penalty = 0;
            long currentTime = 0;

            for (int i = 0; i < n; i++) {
                currentTime += times[i];
                penalty += currentTime;
            }

            System.out.println(penalty);
        }
    }
}

import java.util.*;
import java.io.*;

public class Main {
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        String line;

        while ((line = br.readLine()) != null) {
            int n = Integer.parseInt(line.trim());
            if (n == 0) continue;

            int[] times = new int[n];
            String[] parts = br.readLine().trim().split("\\s+");
            for (int i = 0; i < n; i++) {
                times[i] = Integer.parseInt(parts[i]);
            }

            Arrays.sort(times);

            long penalty = 0;
            long currentTime = 0;

            for (int i = 0; i < n; i++) {
                currentTime += times[i];
                penalty += currentTime;
            }

            System.out.println(penalty);
        }
    }
}

import java.util.*;
import java.io.*;

public class Main {
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        String line;

        while ((line = br.readLine()) != null) {
            int n = Integer.parseInt(line.trim());
            if (n == 0) continue;

            int[] times = new int[n];
            String[] parts = br.readLine().trim().split("\\s+");
            for (int i = 0; i < n; i++) {
                times[i] = Integer.parseInt(parts[i]);
            }

            Arrays.sort(times);

            long penalty = 0;
            long cumulative = 0;

            for (int i = 0; i < n; i++) {
                cumulative += times[i];
                penalty += cumulative;
            }

            System.out.println(penalty);
        }
    }
}

import java.util.*;
import java.io.*;

public class Main {
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        String line;

        while ((line = br.readLine()) != null) {
            int n = Integer.parseInt(line.trim());
            if (n == 0) continue;

            int[] times = new int[n];
            String[] parts = br.readLine().trim().split("\\s+");
            for (int i = 0; i < n; i++) {
                times[i] = Integer.parseInt(parts[i]);
            }

            Arrays.sort(times);

            long penalty = 0;
            long currentTime = 0;

            for (int i = 0; i < n; i++) {
                currentTime += times[i];
                penalty += currentTime;
            }

            System.out.println(penalty);
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        while (true) {
            int N = scanner.nextInt();
            int K = scanner.nextInt();

            if (N == 0 && K == 0) {
                break;
            }

            int[] available = new int[K];
            for (int i = 0; i < K; i++) {
                available[i] = scanner.nextInt();
            }

            int[][] requirements = new int[N][K];
            for (int i = 0; i < N; i++) {
                for (int j = 0; j < K; j++) {
                    requirements[i][j] = scanner.nextInt();
                }
            }

            int[] totalNeeded = new int[K];
            for (int j = 0; j < K; j++) {
                for (int i = 0; i < N; i++) {
                    totalNeeded[j] += requirements[i][j];
                }
            }

            boolean possible = true;
            for (int j = 0; j < K; j++) {
                if (totalNeeded[j] > available[j]) {
                    possible = false;
                    break;
                }
            }

            System.out.println(possible ? "Yes" : "No");
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int N = sc.nextInt();
            int K = sc.nextInt();

            if (N == 0 && K == 0) {
                break;
            }

            int[] stock = new int[K];
            for (int i = 0; i < K; i++) {
                stock[i] = sc.nextInt();
            }

            int[][] needs = new int[N][K];
            for (int i = 0; i < N; i++) {
                for (int j = 0; j < K; j++) {
                    needs[i][j] = sc.nextInt();
                }
            }

            int[] totalNeeded = new int[K];
            for (int j = 0; j < K; j++) {
                for (int i = 0; i < N; i++) {
                    totalNeeded[j] += needs[i][j];
                }
            }

            boolean possible = true;
            for (int j = 0; j < K; j++) {
                if (totalNeeded[j] > stock[j]) {
                    possible = false;
                    break;
                }
            }

            System.out.println(possible ? "Yes" : "No");
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int K = sc.nextInt();
            if (K == 0) break;

            int sumOfPairs = 0;
            int numPairs = K * (K - 1) / 2;

            for (int i = 0; i < numPairs; i++) {
                sumOfPairs += sc.nextInt();
            }

            int totalSales = sumOfPairs / (K - 1);
            System.out.println(totalSales);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int K = sc.nextInt();
            if (K == 0) break;

            int sum = 0;
            int pairCount = K * (K - 1) / 2;

            for (int i = 0; i < pairCount; i++) {
                sum += sc.nextInt();
            }

            int totalSales = sum / (K - 1);
            System.out.println(totalSales);
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            int m = sc.nextInt();

            if (n == 0 && m == 0) break;

            List<Integer> times = new ArrayList<>();

            for (int i = 0; i < n; i++) {
                times.add(sc.nextInt());
            }

            for (int i = 0; i < m; i++) {
                times.add(sc.nextInt());
            }

            Collections.sort(times);

            int maxGap = 0;

            if (!times.isEmpty()) {
                maxGap = Math.max(maxGap, times.get(0));
            }

            for (int i = 1; i < times.size(); i++) {
                maxGap = Math.max(maxGap, times.get(i) - times.get(i-1));
            }

            System.out.println(maxGap);
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            int m = sc.nextInt();

            if (n == 0 && m == 0) break;

            List<Integer> allTimes = new ArrayList<>();

            for (int i = 0; i < n; i++) {
                allTimes.add(sc.nextInt());
            }

            for (int i = 0; i < m; i++) {
                allTimes.add(sc.nextInt());
            }

            Collections.sort(allTimes);

            int maxGap = 0;

            if (!allTimes.isEmpty()) {
                maxGap = Math.max(maxGap, allTimes.get(0));
            }

            for (int i = 1; i < allTimes.size(); i++) {
                maxGap = Math.max(maxGap, allTimes.get(i) - allTimes.get(i-1));
            }

            System.out.println(maxGap);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            if (n == 0) break;

            int totalHits = 0;
            int rounds = n / 4;

            for (int i = 0; i < rounds; i++) {
                totalHits += sc.nextInt();
            }

            System.out.println(totalHits);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        while (true) {
            int n = scanner.nextInt();
            if (n == 0) break;

            int totalHits = 0;
            int rounds = n / 4;

            for (int i = 0; i < rounds; i++) {
                totalHits += scanner.nextInt();
            }

            System.out.println(totalHits);
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        while (true) {
            int n = scanner.nextInt();
            if (n == 0) break;

            int totalHits = 0;
            int rounds = n / 4;

            for (int i = 0; i < rounds; i++) {
                totalHits += scanner.nextInt();
            }

            System.out.println(totalHits);
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            if (n == 0) break;

            int totalHits = 0;
            int rounds = n / 4;

            for (int i = 0; i < rounds; i++) {
                totalHits += sc.nextInt();
            }

            System.out.println(totalHits);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        while (true) {
            int n = scanner.nextInt();
            if (n == 0) break;

            int totalHits = 0;
            int rounds = n / 4;

            for (int i = 0; i < rounds; i++) {
                totalHits += scanner.nextInt();
            }

            System.out.println(totalHits);
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(Scanner.class);

        while (scanner.hasNextLine()) {
            String line = scanner.nextLine();
            if (line.equals("END OF INPUT")) {
                break;
            }

            String[] words = line.split(" ", -1);
            StringBuilder result = new StringBuilder();

            for (String word : words) {
                result.append(word.length());
            }

            System.out.println(result.toString());
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(Scanner.class);

        while (scanner.hasNextLine()) {
            String line = scanner.nextLine();
            if (line.equals("END OF INPUT")) {
                break;
            }

            String[] words = line.split(" ", -1);
            StringBuilder result = new StringBuilder();

            for (String word : words) {
                result.append(word.length());
            }

            System.out.println(result.toString());
        }

        scanner.close();
    }
}

import java.util.*;

public class Main {
    static class Team {
        int id, university, solved, penalty;

        Team(int id, int university, int solved, int penalty) {
            this.id = id;
            this.university = university;
            this.solved = solved;
            this.penalty = penalty;
        }
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            if (n == 0) break;

            List<Team> teams = new ArrayList<>();
            for (int i = 0; i < n; i++) {
                int id = sc.nextInt();
                int university = sc.nextInt();
                int solved = sc.nextInt();
                int penalty = sc.nextInt();
                teams.add(new Team(id, university, solved, penalty));
            }

            teams.sort((a, b) -> {
                if (a.solved != b.solved) return b.solved - a.solved;
                if (a.penalty != b.penalty) return a.penalty - b.penalty;
                return a.id - b.id;
            });

            List<Integer> selected = new ArrayList<>();
            Map<Integer, Integer> universityCount = new HashMap<>();

            for (Team team : teams) {
                int selectedCount = selected.size();
                int uniCount = universityCount.getOrDefault(team.university, 0);

                boolean canSelect = false;

                if (selectedCount < 10 && uniCount < 3) {
                    canSelect = true;
                } else if (selectedCount < 20 && uniCount < 2) {
                    canSelect = true;
                } else if (selectedCount < 26 && uniCount == 0) {
                    canSelect = true;
                }

                if (canSelect) {
                    selected.add(team.id);
                    universityCount.put(team.university, uniCount + 1);
                }
            }

            for (int id : selected) {
                System.out.println(id);
            }
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    static class Team {
        int id, university, solved, penalty;

        Team(int id, int university, int solved, int penalty) {
            this.id = id;
            this.university = university;
            this.solved = solved;
            this.penalty = penalty;
        }
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            if (n == 0) break;

            List<Team> teams = new ArrayList<>();
            for (int i = 0; i < n; i++) {
                int id = sc.nextInt();
                int university = sc.nextInt();
                int solved = sc.nextInt();
                int penalty = sc.nextInt();
                teams.add(new Team(id, university, solved, penalty));
            }

            teams.sort((a, b) -> {
                if (a.solved != b.solved) return b.solved - a.solved;
                if (a.penalty != b.penalty) return a.penalty - b.penalty;
                return a.id - b.id;
            });

            List<Integer> selected = new ArrayList<>();
            Map<Integer, Integer> universityCount = new HashMap<>();

            for (Team team : teams) {
                int currentSelected = selected.size();
                int universityTeams = universityCount.getOrDefault(team.university, 0);

                boolean canSelect = false;

                if (currentSelected < 10 && universityTeams < 3) {
                    canSelect = true;
                } else if (currentSelected < 20 && universityTeams < 2) {
                    canSelect = true;
                } else if (currentSelected < 26 && universityTeams == 0) {
                    canSelect = true;
                }

                if (canSelect) {
                    selected.add(team.id);
                    universityCount.put(team.university, universityTeams + 1);
                }
            }

            for (int id : selected) {
                System.out.println(id);
            }
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    static class Team {
        int id, university, solved, penalty;

        Team(int id, int university, int solved, int penalty) {
            this.id = id;
            this.university = university;
            this.solved = solved;
            this.penalty = penalty;
        }
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            if (n == 0) break;

            List<Team> teams = new ArrayList<>();
            for (int i = 0; i < n; i++) {
                int id = sc.nextInt();
                int university = sc.nextInt();
                int solved = sc.nextInt();
                int penalty = sc.nextInt();
                teams.add(new Team(id, university, solved, penalty));
            }

            teams.sort((a, b) -> {
                if (a.solved != b.solved) return b.solved - a.solved;
                if (a.penalty != b.penalty) return a.penalty - b.penalty;
                return a.id - b.id;
            });

            List<Integer> selected = new ArrayList<>();
            Map<Integer, Integer> universityCount = new HashMap<>();

            for (Team team : teams) {
                int selectedCount = selected.size();
                int uniCount = universityCount.getOrDefault(team.university, 0);

                boolean select = false;

                if (selectedCount < 10 && uniCount < 3) {
                    select = true;
                } else if (selectedCount < 20 && uniCount < 2) {
                    select = true;
                } else if (selectedCount < 26 && uniCount == 0) {
                    select = true;
                }

                if (select) {
                    selected.add(team.id);
                    universityCount.put(team.university, uniCount + 1);
                }
            }

            for (int id : selected) {
                System.out.println(id);
            }
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            if (n == 0) break;

            int[] pages = new int[n];
            for (int i = 0; i < n; i++) {
                pages[i] = sc.nextInt();
            }

            List<String> result = new ArrayList<>();
            int start = 0;

            while (start < n) {
                int end = start;
                while (end + 1 < n && pages[end + 1] == pages[end] + 1) {
                    end++;
                }

                if (start == end) {
                    result.add(String.valueOf(pages[start]));
                } else {
                    result.add(pages[start] + "-" + pages[end]);
                }

                start = end + 1;
            }

            System.out.println(String.join(" ", result));
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            if (n == 0) break;

            int[] pages = new int[n];
            for (int i = 0; i < n; i++) {
                pages[i] = sc.nextInt();
            }

            List<String> result = new ArrayList<>();
            int start = 0;

            while (start < n) {
                int end = start;
                while (end + 1 < n && pages[end + 1] == pages[end] + 1) {
                    end++;
                }

                if (start == end) {
                    result.add(String.valueOf(pages[start]));
                } else {
                    result.add(pages[start] + "-" + pages[end]);
                }

                start = end + 1;
            }

            System.out.println(String.join(" ", result));
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            if (n == 0) break;

            int[] pages = new int[n];
            for (int i = 0; i < n; i++) {
                pages[i] = sc.nextInt();
            }

            List<String> result = new ArrayList<>();
            int start = 0;

            while (start < n) {
                int end = start;
                while (end + 1 < n && pages[end + 1] == pages[end] + 1) {
                    end++;
                }

                if (start == end) {
                    result.add(String.valueOf(pages[start]));
                } else {
                    result.add(pages[start] + "-" + pages[end]);
                }

                start = end + 1;
            }

            System.out.println(String.join(" ", result));
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            if (n == 0) break;

            int[] treasures = new int[n];
            int[] maxLoad = new int[n];

            for (int i = 0; i < n; i++) {
                treasures[i] = sc.nextInt();
                maxLoad[i] = sc.nextInt();
            }

            if (canCollectAll(n, treasures, maxLoad)) {
                System.out.println("Yes");
            } else {
                System.out.println("No");
            }
        }
        sc.close();
    }

    static boolean canCollectAll(int n, int[] treasures, int[] maxLoad) {
        int[] order = new int[n];
        for (int i = 0; i < n; i++) {
            order[i] = i;
        }

        return checkAllPermutations(order, 0, treasures, maxLoad);
    }

    static boolean checkAllPermutations(int[] order, int pos, int[] treasures, int[] maxLoad) {
        if (pos == order.length) {
            return isValidPath(order, treasures, maxLoad);
        }

        for (int i = pos; i < order.length; i++) {
            swap(order, pos, i);
            if (checkAllPermutations(order, pos + 1, treasures, maxLoad)) {
                return true;
            }
            swap(order, pos, i);
        }

        return false;
    }

    static boolean isValidPath(int[] order, int[] treasures, int[] maxLoad) {
        int currentTreasures = 0;

        for (int i = 0; i < order.length; i++) {
            int island = order[i];

            if (currentTreasures > maxLoad[island]) {
                return false;
            }

            currentTreasures += treasures[island];
        }

        for (int i = 0; i < maxLoad.length; i++) {
            if (currentTreasures <= maxLoad[i]) {
                return true;
            }
        }

        return false;
    }

    static void swap(int[] arr, int i, int j) {
        int temp = arr[i];
        arr[i] = arr[j];
        arr[j] = temp;
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            if (n == 0) break;

            int[] treasures = new int[n];
            int[] limits = new int[n];

            for (int i = 0; i < n; i++) {
                treasures[i] = sc.nextInt();
                limits[i] = sc.nextInt();
            }

            if (canCollectAll(n, treasures, limits)) {
                System.out.println("Yes");
            } else {
                System.out.println("No");
            }
        }
        sc.close();
    }

    static boolean canCollectAll(int n, int[] treasures, int[] limits) {
        int[] order = new int[n];
        for (int i = 0; i < n; i++) {
            order[i] = i;
        }

        return checkAllPermutations(order, 0, treasures, limits);
    }

    static boolean checkAllPermutations(int[] order, int pos, int[] treasures, int[] limits) {
        if (pos == order.length) {
            return isValidPath(order, treasures, limits);
        }

        for (int i = pos; i < order.length; i++) {
            swap(order, pos, i);
            if (checkAllPermutations(order, pos + 1, treasures, limits)) {
                return true;
            }
            swap(order, pos, i);
        }

        return false;
    }

    static boolean isValidPath(int[] order, int[] treasures, int[] limits) {
        int currentTreasure = 0;

        for (int i = 0; i < order.length; i++) {
            int island = order[i];

            if (currentTreasure > limits[island]) {
                return false;
            }

            currentTreasure += treasures[island];
        }

        for (int i = 0; i < limits.length; i++) {
            if (currentTreasure <= limits[i]) {
                return true;
            }
        }

        return false;
    }

    static void swap(int[] arr, int i, int j) {
        int temp = arr[i];
        arr[i] = arr[j];
        arr[j] = temp;
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            if (n == 0) break;

            Map<String, List<Integer>> characterTimes = new HashMap<>();
            List<String> names = new ArrayList<>();

            for (int i = 0; i < n; i++) {
                String name = sc.next();
                int m = sc.nextInt();
                List<Integer> times = new ArrayList<>();
                for (int j = 0; j < m; j++) {
                    times.add(sc.nextInt());
                }
                characterTimes.put(name, times);
                names.add(name);
            }

            Map<Integer, Integer> timeCount = new HashMap<>();
            for (String name : names) {
                for (int time : characterTimes.get(name)) {
                    timeCount.put(time, timeCount.getOrDefault(time, 0) + 1);
                }
            }

            Map<String, Integer> points = new HashMap<>();
            for (String name : names) {
                int totalPoints = 0;
                for (int time : characterTimes.get(name)) {
                    int charactersAtTime = timeCount.get(time);
                    totalPoints += n + 1 - charactersAtTime;
                }
                points.put(name, totalPoints);
            }

            int minPoints = Integer.MAX_VALUE;
            String minName = "";

            for (String name : names) {
                int p = points.get(name);
                if (p < minPoints || (p == minPoints && name.compareTo(minName) < 0)) {
                    minPoints = p;
                    minName = name;
                }
            }

            System.out.println(minPoints + " " + minName);
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            if (n == 0) break;

            Map<String, List<Integer>> characters = new HashMap<>();
            List<String> names = new ArrayList<>();

            for (int i = 0; i < n; i++) {
                String name = sc.next();
                int m = sc.nextInt();
                List<Integer> times = new ArrayList<>();
                for (int j = 0; j < m; j++) {
                    times.add(sc.nextInt());
                }
                characters.put(name, times);
                names.add(name);
            }

            Map<Integer, Integer> timeCount = new HashMap<>();
            for (String name : names) {
                for (int time : characters.get(name)) {
                    timeCount.put(time, timeCount.getOrDefault(time, 0) + 1);
                }
            }

            Map<String, Integer> points = new HashMap<>();
            for (String name : names) {
                int totalPoints = 0;
                for (int time : characters.get(name)) {
                    int count = timeCount.get(time);
                    totalPoints += n + 1 - count;
                }
                points.put(name, totalPoints);
            }

            int minPoints = Integer.MAX_VALUE;
            String minName = "";

            for (String name : names) {
                int p = points.get(name);
                if (p < minPoints || (p == minPoints && name.compareTo(minName) < 0)) {
                    minPoints = p;
                    minName = name;
                }
            }

            System.out.println(minPoints + " " + minName);
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            if (n == 0) break;

            Map<String, List<Integer>> characters = new HashMap<>();

            for (int i = 0; i < n; i++) {
                String name = sc.next();
                int m = sc.nextInt();
                List<Integer> times = new ArrayList<>();
                for (int j = 0; j < m; j++) {
                    times.add(sc.nextInt());
                }
                characters.put(name, times);
            }

            Map<Integer, Integer> timeCount = new HashMap<>();
            for (List<Integer> times : characters.values()) {
                for (int time : times) {
                    timeCount.put(time, timeCount.getOrDefault(time, 0) + 1);
                }
            }

            Map<String, Integer> points = new HashMap<>();
            for (Map.Entry<String, List<Integer>> entry : characters.entrySet()) {
                String name = entry.getKey();
                List<Integer> times = entry.getValue();
                int totalPoints = 0;

                for (int time : times) {
                    int charCount = timeCount.get(time);
                    int pointsAtTime = n - charCount + 1;
                    totalPoints += pointsAtTime;
                }

                points.put(name, totalPoints);
            }

            int minPoints = Integer.MAX_VALUE;
            String minCharacter = "";

            for (Map.Entry<String, Integer> entry : points.entrySet()) {
                String name = entry.getKey();
                int point = entry.getValue();

                if (point < minPoints || (point == minPoints && name.compareTo(minCharacter) < 0)) {
                    minPoints = point;
                    minCharacter = name;
                }
            }

            System.out.println(minPoints + " " + minCharacter);
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            if (n == 0) break;

            Map<String, List<Integer>> characters = new HashMap<>();

            for (int i = 0; i < n; i++) {
                String name = sc.next();
                int m = sc.nextInt();
                List<Integer> times = new ArrayList<>();
                for (int j = 0; j < m; j++) {
                    times.add(sc.nextInt());
                }
                characters.put(name, times);
            }

            Map<Integer, Integer> timeCount = new HashMap<>();
            for (List<Integer> times : characters.values()) {
                for (int time : times) {
                    timeCount.put(time, timeCount.getOrDefault(time, 0) + 1);
                }
            }

            Map<String, Integer> points = new HashMap<>();
            for (Map.Entry<String, List<Integer>> entry : characters.entrySet()) {
                String name = entry.getKey();
                List<Integer> times = entry.getValue();
                int totalPoints = 0;

                for (int time : times) {
                    int charactersAtTime = timeCount.get(time);
                    int pointsAtTime = n - charactersAtTime + 1;
                    totalPoints += pointsAtTime;
                }

                points.put(name, totalPoints);
            }

            int minPoints = Integer.MAX_VALUE;
            String minCharacter = "";

            for (Map.Entry<String, Integer> entry : points.entrySet()) {
                String name = entry.getKey();
                int point = entry.getValue();

                if (point < minPoints || (point == minPoints && name.compareTo(minCharacter) < 0)) {
                    minPoints = point;
                    minCharacter = name;
                }
            }

            System.out.println(minPoints + " " + minCharacter);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            int S = sc.nextInt();

            if (n == 0 && S == 0) break;

            int[] r = new int[n];
            for (int i = 0; i < n; i++) {
                r[i] = sc.nextInt();
            }

            int count = 0;
            for (int i = 0; i < n; i++) {
                for (int j = i + 1; j < n; j++) {
                    if (r[i] + r[j] > S) {
                        count++;
                    }
                }
            }

            System.out.println(count);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            int S = sc.nextInt();

            if (n == 0 && S == 0) break;

            int[] r = new int[n];
            for (int i = 0; i < n; i++) {
                r[i] = sc.nextInt();
            }

            int count = 0;
            for (int i = 0; i < n; i++) {
                for (int j = i + 1; j < n; j++) {
                    if (r[i] + r[j] > S) {
                        count++;
                    }
                }
            }

            System.out.println(count);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            int S = sc.nextInt();

            if (n == 0 && S == 0) break;

            int[] r = new int[n];
            for (int i = 0; i < n; i++) {
                r[i] = sc.nextInt();
            }

            int count = 0;
            for (int i = 0; i < n; i++) {
                for (int j = i + 1; j < n; j++) {
                    if (r[i] + r[j] > S) {
                        count++;
                    }
                }
            }

            System.out.println(count);
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            int S = sc.nextInt();

            if (n == 0 && S == 0) break;

            int[] r = new int[n];
            for (int i = 0; i < n; i++) {
                r[i] = sc.nextInt();
            }

            Arrays.sort(r);

            int count = 0;
            int left = 0;
            int right = n - 1;

            while (left < right) {
                if (r[left] + r[right] > S) {
                    count += right - left;
                    right--;
                } else {
                    left++;
                }
            }

            System.out.println(count);
        }

        sc.close();
    }
}

import java.util.*;

public class Spellcasters {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        while (true) {
            int n = scanner.nextInt();
            int S = scanner.nextInt();
            if (n == 0 && S == 0) break;

            int[] r = new int[n];
            for (int i = 0; i < n; i++) {
                r[i] = scanner.nextInt();
            }

            Arrays.sort(r);

            int count = 0;
            int left = 0;
            int right = n - 1;

            while (left < right) {
                if (r[left] + r[right] > S) {
                    count += right - left;
                    right--;
                } else {
                    left++;
                }
            }

            System.out.println(count);
        }
        scanner.close();
    }
}

import java.util.*;

public class Spellcasters {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        while (true) {
            int n = sc.nextInt();
            int S = sc.nextInt();
            if (n == 0 && S == 0) break;

            int[] r = new int[n];
            for (int i = 0; i < n; i++) {
                r[i] = sc.nextInt();
            }

            Arrays.sort(r);
            int count = 0;
            int left = 0;
            int right = n - 1;

            while (left < right) {
                if (r[left] + r[right] > S) {
                    count += right - left;
                    right--;
                } else {
                    left++;
                }
            }

            System.out.println(count);
        }
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int caseNum = 1;

        while (true) {
            int n = sc.nextInt();
            if (n == 0) break;

            int[] x = new int[n];
            int[] y = new int[n];

            for (int i = 0; i < n; i++) {
                x[i] = sc.nextInt();
                y[i] = sc.nextInt();
            }

            double area = 0.0;
            for (int i = 0; i < n; i++) {
                int j = (i + 1) % n;
                area += (double)x[i] * y[j] - (double)x[j] * y[i];
            }
            area = Math.abs(area) / 2.0;

            System.out.printf("%d %.1f%n", caseNum, area);
            caseNum++;
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int caseNum = 1;

        while (true) {
            int n = sc.nextInt();
            if (n == 0) break;

            int[] x = new int[n];
            int[] y = new int[n];

            for (int i = 0; i < n; i++) {
                x[i] = sc.nextInt();
                y[i] = sc.nextInt();
            }

            double area = 0.0;
            for (int i = 0; i < n; i++) {
                int j = (i + 1) % n;
                area += (double)x[i] * y[j] - (double)x[j] * y[i];
            }
            area = Math.abs(area) / 2.0;

            System.out.printf("%d %.1f\n", caseNum, area);
            caseNum++;
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int caseNumber = 1;

        while (true) {
            int n = scanner.nextInt();
            if (n == 0) break;

            int[] x = new int[n];
            int[] y = new int[n];

            for (int i = 0; i < n; i++) {
                x[i] = scanner.nextInt();
                y[i] = scanner.nextInt();
            }

            double area = 0.0;
            for (int i = 0; i < n; i++) {
                int j = (i + 1) % n;
                area += (double)x[i] * y[j] - (double)x[j] * y[i];
            }
            area = Math.abs(area) / 2.0;

            System.out.printf("%d %.1f\n", caseNumber, area);
            caseNumber++;
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int caseNumber = 1;

        while (true) {
            int n = scanner.nextInt();
            if (n == 0) break;

            int[] x = new int[n];
            int[] y = new int[n];

            for (int i = 0; i < n; i++) {
                x[i] = scanner.nextInt();
                y[i] = scanner.nextInt();
            }

            double area = 0.0;
            for (int i = 0; i < n; i++) {
                int j = (i + 1) % n;
                area += (double)x[i] * y[j] - (double)x[j] * y[i];
            }
            area = Math.abs(area) / 2.0;

            System.out.printf("%d %.1f\n", caseNumber, area);
            caseNumber++;
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int m = sc.nextInt();
            int n = sc.nextInt();

            if (m == 0 && n == 0) break;

            int x = 1, y = 1;
            int dir = 0;

            int[] dx = {0, 1, 0, -1};
            int[] dy = {1, 0, -1, 0};

            String command;
            while (!(command = sc.next()).equals("STOP")) {
                switch (command) {
                    case "FORWARD":
                        int steps = sc.nextInt();
                        for (int i = 0; i < steps; i++) {
                            int nx = x + dx[dir];
                            int ny = y + dy[dir];
                            if (nx >= 1 && nx <= m && ny >= 1 && ny <= n) {
                                x = nx;
                                y = ny;
                            } else {
                                break;
                            }
                        }
                        break;
                    case "BACKWARD":
                        int backSteps = sc.nextInt();
                        for (int i = 0; i < backSteps; i++) {
                            int nx = x - dx[dir];
                            int ny = y - dy[dir];
                            if (nx >= 1 && nx <= m && ny >= 1 && ny <= n) {
                                x = nx;
                                y = ny;
                            } else {
                                break;
                            }
                        }
                        break;
                    case "RIGHT":
                        dir = (dir + 1) % 4;
                        break;
                    case "LEFT":
                        dir = (dir + 3) % 4;
                        break;
                }
            }

            System.out.println(x + " " + y);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int m = sc.nextInt();
            int n = sc.nextInt();

            if (m == 0 && n == 0) break;

            int x = 1, y = 1;
            int dir = 0;

            int[] dx = {0, 1, 0, -1};
            int[] dy = {1, 0, -1, 0};

            String command;
            while (!(command = sc.next()).equals("STOP")) {
                switch (command) {
                    case "FORWARD":
                        int steps = sc.nextInt();
                        for (int i = 0; i < steps; i++) {
                            int newX = x + dx[dir];
                            int newY = y + dy[dir];
                            if (newX >= 1 && newX <= m && newY >= 1 && newY <= n) {
                                x = newX;
                                y = newY;
                            } else {
                                break;
                            }
                        }
                        break;
                    case "BACKWARD":
                        int backSteps = sc.nextInt();
                        for (int i = 0; i < backSteps; i++) {
                            int newX = x - dx[dir];
                            int newY = y - dy[dir];
                            if (newX >= 1 && newX <= m && newY >= 1 && newY <= n) {
                                x = newX;
                                y = newY;
                            } else {
                                break;
                            }
                        }
                        break;
                    case "RIGHT":
                        dir = (dir + 1) % 4;
                        break;
                    case "LEFT":
                        dir = (dir + 3) % 4;
                        break;
                }
            }

            System.out.println(x + " " + y);
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int m = sc.nextInt();

        for (int test = 0; test < m; test++) {
            int[][] grid = new int[5][5];
            for (int i = 0; i < 5; i++) {
                for (int j = 0; j < 5; j++) {
                    grid[i][j] = sc.nextInt();
                }
            }

            System.out.println(largestRectangle(grid));
        }
    }

    static int largestRectangle(int[][] grid) {
        int maxArea = 0;
        int[][] heights = new int[5][5];

        for (int i = 0; i < 5; i++) {
            for (int j = 0; j < 5; j++) {
                if (grid[i][j] == 1) {
                    heights[i][j] = (i == 0) ? 1 : heights[i-1][j] + 1;
                } else {
                    heights[i][j] = 0;
                }
            }
        }

        for (int i = 0; i < 5; i++) {
            maxArea = Math.max(maxArea, largestRectangleInHistogram(heights[i]));
        }

        return maxArea;
    }

    static int largestRectangleInHistogram(int[] heights) {
        Stack<Integer> stack = new Stack<>();
        int maxArea = 0;

        for (int i = 0; i <= heights.length; i++) {
            int h = (i == heights.length) ? 0 : heights[i];

            while (!stack.isEmpty() && h < heights[stack.peek()]) {
                int height = heights[stack.pop()];
                int width = stack.isEmpty() ? i : i - stack.peek() - 1;
                maxArea = Math.max(maxArea, height * width);
            }
            stack.push(i);
        }

        return maxArea;
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int m = sc.nextInt();

        for (int test = 0; test < m; test++) {
            int[][] grid = new int[5][5];
            for (int i = 0; i < 5; i++) {
                for (int j = 0; j < 5; j++) {
                    grid[i][j] = sc.nextInt();
                }
            }

            System.out.println(largestRectangle(grid));
        }
    }

    static int largestRectangle(int[][] grid) {
        int maxArea = 0;
        int[][] heights = new int[5][5];

        for (int i = 0; i < 5; i++) {
            for (int j = 0; j < 5; j++) {
                if (grid[i][j] == 1) {
                    heights[i][j] = (i == 0) ? 1 : heights[i-1][j] + 1;
                } else {
                    heights[i][j] = 0;
                }
            }
        }

        for (int i = 0; i < 5; i++) {
            maxArea = Math.max(maxArea, largestRectangleInHistogram(heights[i]));
        }

        return maxArea;
    }

    static int largestRectangleInHistogram(int[] heights) {
        Stack<Integer> stack = new Stack<>();
        int maxArea = 0;

        for (int i = 0; i <= heights.length; i++) {
            int h = (i == heights.length) ? 0 : heights[i];

            while (!stack.isEmpty() && h < heights[stack.peek()]) {
                int height = heights[stack.pop()];
                int width = stack.isEmpty() ? i : i - stack.peek() - 1;
                maxArea = Math.max(maxArea, height * width);
            }
            stack.push(i);
        }

        return maxArea;
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int m = sc.nextInt();

        for (int test = 0; test < m; test++) {
            int[][] grid = new int[5][5];
            for (int i = 0; i < 5; i++) {
                for (int j = 0; j < 5; j++) {
                    grid[i][j] = sc.nextInt();
                }
            }

            int maxArea = 0;

            for (int r1 = 0; r1 < 5; r1++) {
                for (int c1 = 0; c1 < 5; c1++) {
                    for (int r2 = r1; r2 < 5; r2++) {
                        for (int c2 = c1; c2 < 5; c2++) {
                            boolean valid = true;
                            int area = 0;

                            for (int i = r1; i <= r2 && valid; i++) {
                                for (int j = c1; j <= c2 && valid; j++) {
                                    if (grid[i][j] == 0) {
                                        valid = false;
                                    } else {
                                        area++;
                                    }
                                }
                            }

                            if (valid) {
                                maxArea = Math.max(maxArea, area);
                            }
                        }
                    }
                }
            }

            System.out.println(maxArea);
        }
        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int m = sc.nextInt();

        for (int test = 0; test < m; test++) {
            int[][] grid = new int[5][5];
            for (int i = 0; i < 5; i++) {
                for (int j = 0; j < 5; j++) {
                    grid[i][j] = sc.nextInt();
                }
            }

            int maxArea = 0;

            for (int r1 = 0; r1 < 5; r1++) {
                for (int c1 = 0; c1 < 5; c1++) {
                    for (int r2 = r1; r2 < 5; r2++) {
                        for (int c2 = c1; c2 < 5; c2++) {
                            boolean valid = true;
                            int area = 0;

                            for (int i = r1; i <= r2 && valid; i++) {
                                for (int j = c1; j <= c2 && valid; j++) {
                                    if (grid[i][j] == 0) {
                                        valid = false;
                                    } else {
                                        area++;
                                    }
                                }
                            }

                            if (valid) {
                                maxArea = Math.max(maxArea, area);
                            }
                        }
                    }
                }
            }

            System.out.println(maxArea);
        }
        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();

        for (int cave = 0; cave < N; cave++) {
            int x = 0, y = 0;
            int maxDist = 0;
            int treasureX = 0, treasureY = 0;

            while (true) {
                int dx = sc.nextInt();
                int dy = sc.nextInt();

                if (dx == 0 && dy == 0) break;

                x += dx;
                y += dy;

                int distSq = x * x + y * y;

                if (distSq > maxDist || (distSq == maxDist && x > treasureX)) {
                    maxDist = distSq;
                    treasureX = x;
                    treasureY = y;
                }
            }

            System.out.println(treasureX + " " + treasureY);
        }
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();

        for (int cave = 0; cave < N; cave++) {
            int x = 0, y = 0;
            int maxDist = 0;
            int treasureX = 0, treasureY = 0;

            while (true) {
                int dx = sc.nextInt();
                int dy = sc.nextInt();

                if (dx == 0 && dy == 0) break;

                x += dx;
                y += dy;

                int distSq = x * x + y * y;

                if (distSq > maxDist || (distSq == maxDist && x > treasureX)) {
                    maxDist = distSq;
                    treasureX = x;
                    treasureY = y;
                }
            }

            System.out.println(treasureX + " " + treasureY);
        }
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int N = sc.nextInt();
            int Q = sc.nextInt();

            if (N == 0 && Q == 0) break;

            Map<Integer, Integer> dateCount = new HashMap<>();

            for (int i = 0; i < N; i++) {
                int M = sc.nextInt();
                for (int j = 0; j < M; j++) {
                    int date = sc.nextInt();
                    dateCount.put(date, dateCount.getOrDefault(date, 0) + 1);
                }
            }

            int bestDate = 0;
            int maxCount = 0;

            for (Map.Entry<Integer, Integer> entry : dateCount.entrySet()) {
                int date = entry.getKey();
                int count = entry.getValue();

                if (count >= Q && (count > maxCount || (count == maxCount && date < bestDate))) {
                    bestDate = date;
                    maxCount = count;
                }
            }

            System.out.println(bestDate);
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int N = sc.nextInt();
            int Q = sc.nextInt();

            if (N == 0 && Q == 0) break;

            Map<Integer, Integer> dateCount = new HashMap<>();

            for (int i = 0; i < N; i++) {
                int M = sc.nextInt();
                for (int j = 0; j < M; j++) {
                    int date = sc.nextInt();
                    dateCount.put(date, dateCount.getOrDefault(date, 0) + 1);
                }
            }

            int bestDate = 0;
            int maxCount = 0;

            for (Map.Entry<Integer, Integer> entry : dateCount.entrySet()) {
                int date = entry.getKey();
                int count = entry.getValue();

                if (count >= Q && (count > maxCount || (count == maxCount && date < bestDate))) {
                    bestDate = date;
                    maxCount = count;
                }
            }

            System.out.println(bestDate);
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int N = sc.nextInt();
            int Q = sc.nextInt();

            if (N == 0 && Q == 0) break;

            Map<Integer, Integer> dateCount = new HashMap<>();

            for (int i = 0; i < N; i++) {
                int M = sc.nextInt();
                for (int j = 0; j < M; j++) {
                    int date = sc.nextInt();
                    dateCount.put(date, dateCount.getOrDefault(date, 0) + 1);
                }
            }

            int bestDate = 0;
            int maxCount = 0;

            for (Map.Entry<Integer, Integer> entry : dateCount.entrySet()) {
                int date = entry.getKey();
                int count = entry.getValue();

                if (count >= Q && (count > maxCount || (count == maxCount && date < bestDate))) {
                    bestDate = date;
                    maxCount = count;
                }
            }

            System.out.println(bestDate);
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int N = sc.nextInt();
            if (N == 0) break;

            int W = sc.nextInt();
            int H = sc.nextInt();

            boolean[][] field = new boolean[H + 1][W + 1];

            for (int i = 0; i < N; i++) {
                int x = sc.nextInt();
                int y = sc.nextInt();
                field[y][x] = true;
            }

            int S = sc.nextInt();
            int T = sc.nextInt();

            int maxTrees = 0;

            for (int startY = 1; startY <= H - T + 1; startY++) {
                for (int startX = 1; startX <= W - S + 1; startX++) {
                    int count = 0;

                    for (int y = startY; y < startY + T; y++) {
                        for (int x = startX; x < startX + S; x++) {
                            if (field[y][x]) {
                                count++;
                            }
                        }
                    }

                    maxTrees = Math.max(maxTrees, count);
                }
            }

            System.out.println(maxTrees);
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int N = sc.nextInt();
            if (N == 0) break;

            int W = sc.nextInt();
            int H = sc.nextInt();

            boolean[][] grid = new boolean[H + 1][W + 1];

            for (int i = 0; i < N; i++) {
                int x = sc.nextInt();
                int y = sc.nextInt();
                grid[y][x] = true;
            }

            int S = sc.nextInt();
            int T = sc.nextInt();

            int maxTrees = 0;

            for (int startY = 1; startY <= H - T + 1; startY++) {
                for (int startX = 1; startX <= W - S + 1; startX++) {
                    int count = 0;

                    for (int y = startY; y < startY + T; y++) {
                        for (int x = startX; x < startX + S; x++) {
                            if (grid[y][x]) {
                                count++;
                            }
                        }
                    }

                    maxTrees = Math.max(maxTrees, count);
                }
            }

            System.out.println(maxTrees);
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int N = sc.nextInt();
            if (N == 0) break;

            int W = sc.nextInt();
            int H = sc.nextInt();

            boolean[][] grid = new boolean[H + 1][W + 1];

            for (int i = 0; i < N; i++) {
                int x = sc.nextInt();
                int y = sc.nextInt();
                grid[y][x] = true;
            }

            int S = sc.nextInt();
            int T = sc.nextInt();

            int maxTrees = 0;

            for (int startY = 1; startY <= H - T + 1; startY++) {
                for (int startX = 1; startX <= W - S + 1; startX++) {
                    int treeCount = 0;

                    for (int y = startY; y < startY + T; y++) {
                        for (int x = startX; x < startX + S; x++) {
                            if (grid[y][x]) {
                                treeCount++;
                            }
                        }
                    }

                    maxTrees = Math.max(maxTrees, treeCount);
                }
            }

            System.out.println(maxTrees);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int N = sc.nextInt();
            if (N == 0) break;

            int W = sc.nextInt();
            int H = sc.nextInt();

            boolean[][] grid = new boolean[H + 1][W + 1];

            for (int i = 0; i < N; i++) {
                int x = sc.nextInt();
                int y = sc.nextInt();
                grid[y][x] = true;
            }

            int S = sc.nextInt();
            int T = sc.nextInt();

            int maxTrees = 0;

            for (int startY = 1; startY <= H - T + 1; startY++) {
                for (int startX = 1; startX <= W - S + 1; startX++) {
                    int count = 0;

                    for (int y = startY; y < startY + T; y++) {
                        for (int x = startX; x < startX + S; x++) {
                            if (grid[y][x]) {
                                count++;
                            }
                        }
                    }

                    maxTrees = Math.max(maxTrees, count);
                }
            }

            System.out.println(maxTrees);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int N = sc.nextInt();
            if (N == 0) break;

            int W = sc.nextInt();
            int H = sc.nextInt();

            boolean[][] grid = new boolean[H + 1][W + 1];

            for (int i = 0; i < N; i++) {
                int x = sc.nextInt();
                int y = sc.nextInt();
                grid[y][x] = true;
            }

            int S = sc.nextInt();
            int T = sc.nextInt();

            int maxTrees = 0;

            for (int startY = 1; startY <= H - T + 1; startY++) {
                for (int startX = 1; startX <= W - S + 1; startX++) {
                    int count = 0;

                    for (int y = startY; y < startY + T; y++) {
                        for (int x = startX; x < startX + S; x++) {
                            if (grid[y][x]) {
                                count++;
                            }
                        }
                    }

                    maxTrees = Math.max(maxTrees, count);
                }
            }

            System.out.println(maxTrees);
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    static int W, H;
    static char[][] matrix;
    static String maxNumber = "0";

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            W = sc.nextInt();
            H = sc.nextInt();

            if (W == 0 && H == 0) break;

            matrix = new char[H][W];
            for (int i = 0; i < H; i++) {
                String line = sc.next();
                for (int j = 0; j < W; j++) {
                    matrix[i][j] = line.charAt(j);
                }
            }

            maxNumber = "0";

            for (int i = 0; i < H; i++) {
                for (int j = 0; j < W; j++) {
                    if (Character.isDigit(matrix[i][j])) {
                        dfs(i, j, "");
                    }
                }
            }

            System.out.println(maxNumber);
        }
    }

    static void dfs(int row, int col, String current) {
        if (row < 0 || row >= H || col < 0 || col >= W) return;
        if (!Character.isDigit(matrix[row][col])) return;

        current += matrix[row][col];

        if (isLarger(current, maxNumber)) {
            maxNumber = current;
        }

        dfs(row, col + 1, current);

        dfs(row + 1, col, current);
    }

    static boolean isLarger(String a, String b) {
        a = removeLeadingZeros(a);
        b = removeLeadingZeros(b);

        if (a.length() != b.length()) {
            return a.length() > b.length();
        }

        return a.compareTo(b) > 0;
    }

    static String removeLeadingZeros(String s) {
        int i = 0;
        while (i < s.length() - 1 && s.charAt(i) == '0') {
            i++;
        }
        return s.substring(i);
    }
}

import java.util.*;

public class Main {
    static int W, H;
    static char[][] matrix;
    static String maxNumber = "0";

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            W = sc.nextInt();
            H = sc.nextInt();
            if (W == 0 && H == 0) break;

            matrix = new char[H][W];
            for (int i = 0; i < H; i++) {
                String line = sc.next();
                for (int j = 0; j < W; j++) {
                    matrix[i][j] = line.charAt(j);
                }
            }

            maxNumber = "0";

            for (int i = 0; i < H; i++) {
                for (int j = 0; j < W; j++) {
                    if (Character.isDigit(matrix[i][j])) {
                        dfs(i, j, "");
                    }
                }
            }

            System.out.println(maxNumber);
        }
    }

    static void dfs(int row, int col, String current) {
        if (row < 0 || row >= H || col < 0 || col >= W) return;
        if (!Character.isDigit(matrix[row][col])) return;

        current += matrix[row][col];

        if (isLarger(current, maxNumber)) {
            maxNumber = current;
        }

        dfs(row, col + 1, current);

        dfs(row + 1, col, current);
    }

    static boolean isLarger(String a, String b) {
        a = removeLeadingZeros(a);
        b = removeLeadingZeros(b);

        if (a.length() != b.length()) {
            return a.length() > b.length();
        }
        return a.compareTo(b) > 0;
    }

    static String removeLeadingZeros(String s) {
        int i = 0;
        while (i < s.length() - 1 && s.charAt(i) == '0') {
            i++;
        }
        return s.substring(i);
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            int r = sc.nextInt();

            if (n == 0 && r == 0) break;

            List<Integer> deck = new ArrayList<>();
            for (int i = 1; i <= n; i++) {
                deck.add(i);
            }

            for (int i = 0; i < r; i++) {
                int p = sc.nextInt();
                int c = sc.nextInt();

                List<Integer> cut = new ArrayList<>();
                for (int j = 0; j < c; j++) {
                    cut.add(deck.remove(p - 1));
                }

                for (int j = c - 1; j >= 0; j--) {
                    deck.add(0, cut.get(j));
                }
            }

            System.out.println(deck.get(deck.size() - 1));
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            int r = sc.nextInt();

            if (n == 0 && r == 0) break;

            List<Integer> deck = new ArrayList<>();
            for (int i = 1; i <= n; i++) {
                deck.add(i);
            }

            for (int i = 0; i < r; i++) {
                int p = sc.nextInt();
                int c = sc.nextInt();

                List<Integer> cut = new ArrayList<>();
                for (int j = 0; j < c; j++) {
                    cut.add(deck.remove(p - 1));
                }

                for (int j = c - 1; j >= 0; j--) {
                    deck.add(0, cut.get(j));
                }
            }

            System.out.println(deck.get(deck.size() - 1));
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            int r = sc.nextInt();

            if (n == 0 && r == 0) break;

            List<Integer> deck = new ArrayList<>();
            for (int i = 1; i <= n; i++) {
                deck.add(i);
            }

            for (int i = 0; i < r; i++) {
                int p = sc.nextInt();
                int c = sc.nextInt();

                List<Integer> extracted = new ArrayList<>();
                for (int j = 0; j < c; j++) {
                    extracted.add(deck.remove(p - 1));
                }

                for (int j = c - 1; j >= 0; j--) {
                    deck.add(0, extracted.get(j));
                }
            }

            System.out.println(deck.get(deck.size() - 1));
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Solution {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int m = sc.nextInt();

        for (int dataset = 0; dataset < m; dataset++) {
            long initialFund = sc.nextLong();
            int years = sc.nextInt();
            int n = sc.nextInt();

            long maxFinalAmount = 0;

            for (int i = 0; i < n; i++) {
                int type = sc.nextInt();
                double rate = sc.nextDouble();
                long charge = sc.nextLong();

                long finalAmount = calculateFinalAmount(initialFund, years, type, rate, charge);
                maxFinalAmount = Math.max(maxFinalAmount, finalAmount);
            }

            System.out.println(maxFinalAmount);
        }
        sc.close();
    }

    private static long calculateFinalAmount(long initialFund, int years, int type, double rate, long charge) {
        if (type == 0) {
            long balance = initialFund;
            long totalInterest = 0;

            for (int year = 0; year < years; year++) {
                long interest = Math.round(balance * rate);
                totalInterest += interest;
                balance -= charge;
            }

            return balance + totalInterest;
        } else {
            long balance = initialFund;

            for (int year = 0; year < years; year++) {
                long interest = Math.round(balance * rate);
                balance = balance + interest - charge;
            }

            return balance;
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int m = sc.nextInt();

        for (int dataset = 0; dataset < m; dataset++) {
            long initialFund = sc.nextLong();
            int years = sc.nextInt();
            int n = sc.nextInt();

            long maxFinalAmount = 0;

            for (int i = 0; i < n; i++) {
                int type = sc.nextInt();
                double rate = sc.nextDouble();
                long charge = sc.nextLong();

                long finalAmount = calculateFinalAmount(initialFund, years, type, rate, charge);
                maxFinalAmount = Math.max(maxFinalAmount, finalAmount);
            }

            System.out.println(maxFinalAmount);
        }
        sc.close();
    }

    private static long calculateFinalAmount(long initialFund, int years, int type, double rate, long charge) {
        if (type == 0) {
            long balance = initialFund;
            long totalInterest = 0;

            for (int year = 0; year < years; year++) {
                long interest = Math.round(balance * rate);
                totalInterest += interest;
                balance -= charge;
            }

            return balance + totalInterest;
        } else {
            long balance = initialFund;

            for (int year = 0; year < years; year++) {
                long interest = Math.round(balance * rate);
                balance = balance + interest - charge;
            }

            return balance;
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int m = sc.nextInt();

        for (int dataset = 0; dataset < m; dataset++) {
            long initialFund = sc.nextLong();
            int years = sc.nextInt();
            int n = sc.nextInt();

            long maxFinalAmount = 0;

            for (int i = 0; i < n; i++) {
                int type = sc.nextInt();
                double rate = sc.nextDouble();
                long charge = sc.nextLong();

                long finalAmount = calculateFinalAmount(initialFund, years, type, rate, charge);
                maxFinalAmount = Math.max(maxFinalAmount, finalAmount);
            }

            System.out.println(maxFinalAmount);
        }
        sc.close();
    }

    private static long calculateFinalAmount(long initialFund, int years, int type, double rate, long charge) {
        if (type == 0) {
            long balance = initialFund;
            long cumulativeInterest = 0;

            for (int year = 0; year < years; year++) {
                long interest = Math.round(balance * rate);
                cumulativeInterest += interest;
                balance -= charge;
            }

            return balance + cumulativeInterest;
        } else {
            long balance = initialFund;

            for (int year = 0; year < years; year++) {
                long interest = Math.round(balance * rate);
                balance = balance + interest - charge;
            }

            return balance;
        }
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int a = sc.nextInt();
            int d = sc.nextInt();
            int n = sc.nextInt();

            if (a == 0 && d == 0 && n == 0) break;

            int count = 0;
            int current = a;

            while (count < n) {
                if (isPrime(current)) {
                    count++;
                    if (count == n) {
                        System.out.println(current);
                        break;
                    }
                }
                current += d;
            }
        }

        sc.close();
    }

    private static boolean isPrime(int num) {
        if (num < 2) return false;
        if (num == 2) return true;
        if (num % 2 == 0) return false;

        for (int i = 3; i * i <= num; i += 2) {
            if (num % i == 0) return false;
        }
        return true;
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int a = sc.nextInt();
            int d = sc.nextInt();
            int n = sc.nextInt();

            if (a == 0 && d == 0 && n == 0) break;

            int count = 0;
            int current = a;

            while (count < n) {
                if (isPrime(current)) {
                    count++;
                    if (count == n) {
                        System.out.println(current);
                        break;
                    }
                }
                current += d;
            }
        }

        sc.close();
    }

    private static boolean isPrime(int num) {
        if (num < 2) return false;
        if (num == 2) return true;
        if (num % 2 == 0) return false;

        for (int i = 3; i * i <= num; i += 2) {
            if (num % i == 0) return false;
        }

        return true;
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int m = sc.nextInt();
        sc.nextLine();

        for (int i = 0; i < m; i++) {
            String train = sc.nextLine();
            System.out.println(countConfigurations(train));
        }
    }

    static int countConfigurations(String train) {
        Set<String> configurations = new HashSet<>();
        int n = train.length();

        for (int split = 1; split < n; split++) {
            String left = train.substring(0, split);
            String right = train.substring(split);

            String leftReversed = new StringBuilder(left).reverse().toString();
            String rightReversed = new StringBuilder(right).reverse().toString();

            configurations.add(left + right);
            configurations.add(left + rightReversed);
            configurations.add(leftReversed + right);
            configurations.add(leftReversed + rightReversed);

            configurations.add(right + left);
            configurations.add(right + leftReversed);
            configurations.add(rightReversed + left);
            configurations.add(rightReversed + leftReversed);
        }

        return configurations.size();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int m = sc.nextInt();
        sc.nextLine();

        for (int i = 0; i < m; i++) {
            String train = sc.nextLine();
            System.out.println(countConfigurations(train));
        }
    }

    static int countConfigurations(String train) {
        Set<String> configurations = new HashSet<>();
        int n = train.length();

        for (int split = 1; split < n; split++) {
            String left = train.substring(0, split);
            String right = train.substring(split);

            String leftReversed = new StringBuilder(left).reverse().toString();
            String rightReversed = new StringBuilder(right).reverse().toString();

            configurations.add(left + right);
            configurations.add(left + rightReversed);
            configurations.add(leftReversed + right);
            configurations.add(leftReversed + rightReversed);
            configurations.add(right + left);
            configurations.add(right + leftReversed);
            configurations.add(rightReversed + left);
            configurations.add(rightReversed + leftReversed);
        }

        return configurations.size();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            if (n == 0) break;

            int[] scores = new int[n];
            for (int i = 0; i < n; i++) {
                scores[i] = sc.nextInt();
            }

            Arrays.sort(scores);

            int sum = 0;
            for (int i = 1; i < n - 1; i++) {
                sum += scores[i];
            }

            int result = sum / (n - 2);
            System.out.println(result);
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            if (n == 0) break;

            int[] scores = new int[n];
            for (int i = 0; i < n; i++) {
                scores[i] = sc.nextInt();
            }

            Arrays.sort(scores);

            int sum = 0;
            for (int i = 1; i < n - 1; i++) {
                sum += scores[i];
            }

            int result = sum / (n - 2);
            System.out.println(result);
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            if (n == 0) break;

            int[] scores = new int[n];
            for (int i = 0; i < n; i++) {
                scores[i] = sc.nextInt();
            }

            Arrays.sort(scores);

            int sum = 0;
            for (int i = 1; i < n - 1; i++) {
                sum += scores[i];
            }

            int result = sum / (n - 2);
            System.out.println(result);
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            if (n == 0) break;

            int[] scores = new int[n];
            for (int i = 0; i < n; i++) {
                scores[i] = sc.nextInt();
            }

            Arrays.sort(scores);

            int sum = 0;
            for (int i = 1; i < n - 1; i++) {
                sum += scores[i];
            }

            int result = sum / (n - 2);
            System.out.println(result);
        }

        sc.close();
    }
}

import java.util.Scanner;
import java.util.Arrays;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            if (n == 0) break;

            int[] scores = new int[n];
            for (int i = 0; i < n; i++) {
                scores[i] = sc.nextInt();
            }

            Arrays.sort(scores);

            int sum = 0;
            for (int i = 1; i < n - 1; i++) {
                sum += scores[i];
            }

            int result = sum / (n - 2);
            System.out.println(result);
        }

        sc.close();
    }
}

import java.util.Scanner;
import java.util.Arrays;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        while (true) {
            int n = scanner.nextInt();
            if (n == 0) break;

            int[] scores = new int[n];
            for (int i = 0; i < n; i++) {
                scores[i] = scanner.nextInt();
            }

            Arrays.sort(scores);
            int sum = 0;
            for (int i = 1; i < n - 1; i++) {
                sum += scores[i];
            }

            int average = sum / (n - 2);
            System.out.println(average);
        }
        scanner.close();
    }
}

import java.util.*;

public class Main {
    static class Record {
        int time, pc, student, status;
        Record(int t, int n, int m, int s) {
            time = t; pc = n; student = m; status = s;
        }
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int N = sc.nextInt();
            int M = sc.nextInt();
            if (N == 0 && M == 0) break;

            int r = sc.nextInt();
            List<Record> records = new ArrayList<>();
            for (int i = 0; i < r; i++) {
                int t = sc.nextInt();
                int n = sc.nextInt();
                int m = sc.nextInt();
                int s = sc.nextInt();
                records.add(new Record(t, n, m, s));
            }

            int q = sc.nextInt();
            for (int i = 0; i < q; i++) {
                int ts = sc.nextInt();
                int te = sc.nextInt();
                int m = sc.nextInt();

                System.out.println(calculateUsage(records, ts, te, m));
            }
        }
    }

    static int calculateUsage(List<Record> records, int ts, int te, int student) {
        Map<Integer, Integer> loginTimes = new HashMap<>();
        int totalUsage = 0;

        for (Record rec : records) {
            if (rec.student != student) continue;

            if (rec.status == 1) {
                loginTimes.put(rec.pc, rec.time);
            } else {
                Integer loginTime = loginTimes.get(rec.pc);
                if (loginTime != null) {
                    int start = Math.max(loginTime, ts);
                    int end = Math.min(rec.time, te);
                    if (start < end) {
                        totalUsage += end - start;
                    }
                    loginTimes.remove(rec.pc);
                }
            }
        }

        for (Map.Entry<Integer, Integer> entry : loginTimes.entrySet()) {
            int loginTime = entry.getValue();
            int start = Math.max(loginTime, ts);
            if (start < te) {
                totalUsage += te - start;
            }
        }

        return totalUsage;
    }
}

import java.util.*;

public class Main {
    static class Record {
        int time, pc, student, action;
        Record(int t, int n, int m, int s) {
            time = t; pc = n; student = m; action = s;
        }
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int N = sc.nextInt();
            int M = sc.nextInt();
            if (N == 0 && M == 0) break;

            int r = sc.nextInt();
            List<Record> records = new ArrayList<>();
            for (int i = 0; i < r; i++) {
                int t = sc.nextInt();
                int n = sc.nextInt();
                int m = sc.nextInt();
                int s = sc.nextInt();
                records.add(new Record(t, n, m, s));
            }

            int q = sc.nextInt();
            for (int i = 0; i < q; i++) {
                int ts = sc.nextInt();
                int te = sc.nextInt();
                int m = sc.nextInt();

                System.out.println(calculateUsage(records, ts, te, m));
            }
        }
    }

    static int calculateUsage(List<Record> records, int ts, int te, int student) {
        Map<Integer, Integer> loginTimes = new HashMap<>();
        int totalUsage = 0;

        for (Record rec : records) {
            if (rec.student != student) continue;

            if (rec.action == 1) {
                loginTimes.put(rec.pc, rec.time);
            } else {
                Integer loginTime = loginTimes.get(rec.pc);
                if (loginTime != null) {
                    int start = Math.max(loginTime, ts);
                    int end = Math.min(rec.time, te);
                    if (start < end) {
                        totalUsage += end - start;
                    }
                    loginTimes.remove(rec.pc);
                }
            }
        }

        for (Map.Entry<Integer, Integer> entry : loginTimes.entrySet()) {
            int loginTime = entry.getValue();
            int start = Math.max(loginTime, ts);
            if (start < te) {
                totalUsage += te - start;
            }
        }

        return totalUsage;
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            int m = sc.nextInt();

            if (n == 0 && m == 0) break;

            int[] taro = new int[n];
            int[] hanako = new int[m];

            int taroSum = 0;
            for (int i = 0; i < n; i++) {
                taro[i] = sc.nextInt();
                taroSum += taro[i];
            }

            int hanakoSum = 0;
            for (int i = 0; i < m; i++) {
                hanako[i] = sc.nextInt();
                hanakoSum += hanako[i];
            }

            int bestTaro = -1, bestHanako = -1;
            int minSum = Integer.MAX_VALUE;

            for (int i = 0; i < n; i++) {
                for (int j = 0; j < m; j++) {
                    int newTaroSum = taroSum - taro[i] + hanako[j];
                    int newHanakoSum = hanakoSum - hanako[j] + taro[i];

                    if (newTaroSum == newHanakoSum) {
                        int sum = taro[i] + hanako[j];
                        if (sum < minSum) {
                            minSum = sum;
                            bestTaro = taro[i];
                            bestHanako = hanako[j];
                        }
                    }
                }
            }

            if (bestTaro == -1) {
                System.out.println(-1);
            } else {
                System.out.println(bestTaro + " " + bestHanako);
            }
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            int m = sc.nextInt();

            if (n == 0 && m == 0) break;

            int[] taro = new int[n];
            int[] hanako = new int[m];

            int taroSum = 0;
            for (int i = 0; i < n; i++) {
                taro[i] = sc.nextInt();
                taroSum += taro[i];
            }

            int hanakoSum = 0;
            for (int i = 0; i < m; i++) {
                hanako[i] = sc.nextInt();
                hanakoSum += hanako[i];
            }

            int bestTaro = -1, bestHanako = -1;
            int minSum = Integer.MAX_VALUE;

            for (int i = 0; i < n; i++) {
                for (int j = 0; j < m; j++) {
                    int newTaroSum = taroSum - taro[i] + hanako[j];
                    int newHanakoSum = hanakoSum - hanako[j] + taro[i];

                    if (newTaroSum == newHanakoSum) {
                        int currentSum = taro[i] + hanako[j];
                        if (currentSum < minSum) {
                            minSum = currentSum;
                            bestTaro = taro[i];
                            bestHanako = hanako[j];
                        }
                    }
                }
            }

            if (bestTaro == -1) {
                System.out.println(-1);
            } else {
                System.out.println(bestTaro + " " + bestHanako);
            }
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            int m = sc.nextInt();

            if (n == 0 && m == 0) break;

            int[] taro = new int[n];
            int[] hanako = new int[m];

            int taroSum = 0;
            for (int i = 0; i < n; i++) {
                taro[i] = sc.nextInt();
                taroSum += taro[i];
            }

            int hanakoSum = 0;
            for (int i = 0; i < m; i++) {
                hanako[i] = sc.nextInt();
                hanakoSum += hanako[i];
            }

            int bestTaro = -1, bestHanako = -1;
            int minSum = Integer.MAX_VALUE;

            for (int i = 0; i < n; i++) {
                for (int j = 0; j < m; j++) {
                    int newTaroSum = taroSum - taro[i] + hanako[j];
                    int newHanakoSum = hanakoSum - hanako[j] + taro[i];

                    if (newTaroSum == newHanakoSum) {
                        int sum = taro[i] + hanako[j];
                        if (sum < minSum) {
                            minSum = sum;
                            bestTaro = taro[i];
                            bestHanako = hanako[j];
                        }
                    }
                }
            }

            if (bestTaro == -1) {
                System.out.println(-1);
            } else {
                System.out.println(bestTaro + " " + bestHanako);
            }
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            int m = sc.nextInt();

            if (n == 0 && m == 0) break;

            int[] taro = new int[n];
            int[] hanako = new int[m];

            int taroSum = 0;
            for (int i = 0; i < n; i++) {
                taro[i] = sc.nextInt();
                taroSum += taro[i];
            }

            int hanakoSum = 0;
            for (int i = 0; i < m; i++) {
                hanako[i] = sc.nextInt();
                hanakoSum += hanako[i];
            }

            int bestTaro = -1, bestHanako = -1;
            int minSum = Integer.MAX_VALUE;

            for (int i = 0; i < n; i++) {
                for (int j = 0; j < m; j++) {
                    int newTaroSum = taroSum - taro[i] + hanako[j];
                    int newHanakoSum = hanakoSum - hanako[j] + taro[i];

                    if (newTaroSum == newHanakoSum) {
                        int currentSum = taro[i] + hanako[j];
                        if (currentSum < minSum) {
                            minSum = currentSum;
                            bestTaro = taro[i];
                            bestHanako = hanako[j];
                        }
                    }
                }
            }

            if (bestTaro == -1) {
                System.out.println(-1);
            } else {
                System.out.println(bestTaro + " " + bestHanako);
            }
        }

        sc.close();
    }
}

import java.util.Scanner;

public class NextMayor {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            int p = sc.nextInt();

            if (n == 0 && p == 0) break;

            int[] pebbles = new int[n];
            int bowlPebbles = p;
            int currentPlayer = 0;

            while (true) {
                if (bowlPebbles > 0) {
                    bowlPebbles--;
                    pebbles[currentPlayer]++;

                    if (bowlPebbles == 0) {
                        boolean othersHavePebbles = false;
                        for (int i = 0; i < n; i++) {
                            if (i != currentPlayer && pebbles[i] > 0) {
                                othersHavePebbles = true;
                                break;
                            }
                        }
                        if (!othersHavePebbles) {
                            System.out.println(currentPlayer);
                            break;
                        }
                    }
                } else {
                    bowlPebbles += pebbles[currentPlayer];
                    pebbles[currentPlayer] = 0;
                }

                currentPlayer = (currentPlayer + 1) % n;
            }
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            int p = sc.nextInt();

            if (n == 0 && p == 0) break;

            int[] pebbles = new int[n];
            int bowlPebbles = p;
            int currentPlayer = 0;

            while (true) {
                if (bowlPebbles > 0) {
                    bowlPebbles--;
                    pebbles[currentPlayer]++;

                    if (bowlPebbles == 0) {
                        boolean othersHavePebbles = false;
                        for (int i = 0; i < n; i++) {
                            if (i != currentPlayer && pebbles[i] > 0) {
                                othersHavePebbles = true;
                                break;
                            }
                        }
                        if (!othersHavePebbles) {
                            System.out.println(currentPlayer);
                            break;
                        }
                    }
                } else {
                    bowlPebbles += pebbles[currentPlayer];
                    pebbles[currentPlayer] = 0;
                }

                currentPlayer = (currentPlayer + 1) % n;
            }
        }

        sc.close();
    }
}

import java.util.Scanner;

public class NextMayor {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            int p = sc.nextInt();

            if (n == 0 && p == 0) break;

            int[] pebbles = new int[n];
            int bowlPebbles = p;
            int currentPlayer = 0;

            while (true) {
                if (bowlPebbles > 0) {
                    bowlPebbles--;
                    pebbles[currentPlayer]++;

                    if (bowlPebbles == 0) {
                        boolean gameEnds = true;
                        for (int i = 0; i < n; i++) {
                            if (i != currentPlayer && pebbles[i] > 0) {
                                gameEnds = false;
                                break;
                            }
                        }
                        if (gameEnds) {
                            System.out.println(currentPlayer);
                            break;
                        }
                    }
                } else {
                    bowlPebbles += pebbles[currentPlayer];
                    pebbles[currentPlayer] = 0;
                }

                currentPlayer = (currentPlayer + 1) % n;
            }
        }

        sc.close();
    }
}

import java.util.Scanner;

public class NextMayor {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            int p = sc.nextInt();

            if (n == 0 && p == 0) break;

            int[] pebbles = new int[n];
            int bowlPebbles = p;
            int currentPlayer = 0;

            while (true) {
                if (bowlPebbles > 0) {
                    bowlPebbles--;
                    pebbles[currentPlayer]++;

                    if (bowlPebbles == 0) {
                        boolean gameEnds = true;
                        for (int i = 0; i < n; i++) {
                            if (i != currentPlayer && pebbles[i] > 0) {
                                gameEnds = false;
                                break;
                            }
                        }
                        if (gameEnds) {
                            System.out.println(currentPlayer);
                            break;
                        }
                    }
                } else {
                    bowlPebbles += pebbles[currentPlayer];
                    pebbles[currentPlayer] = 0;
                }

                currentPlayer = (currentPlayer + 1) % n;
            }
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    private static int[][] map;
    private static boolean[][] visited;
    private static int w, h;

    private static int[] dx = {-1, -1, -1, 0, 0, 1, 1, 1};
    private static int[] dy = {-1, 0, 1, -1, 1, -1, 0, 1};

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            w = sc.nextInt();
            h = sc.nextInt();

            if (w == 0 && h == 0) break;

            map = new int[h][w];
            visited = new boolean[h][w];

            for (int i = 0; i < h; i++) {
                for (int j = 0; j < w; j++) {
                    map[i][j] = sc.nextInt();
                }
            }

            int islands = 0;
            for (int i = 0; i < h; i++) {
                for (int j = 0; j < w; j++) {
                    if (map[i][j] == 1 && !visited[i][j]) {
                        dfs(i, j);
                        islands++;
                    }
                }
            }

            System.out.println(islands);
        }

        sc.close();
    }

    private static void dfs(int x, int y) {
        visited[x][y] = true;

        for (int i = 0; i < 8; i++) {
            int nx = x + dx[i];
            int ny = y + dy[i];

            if (nx >= 0 && nx < h && ny >= 0 && ny < w &&
                map[nx][ny] == 1 && !visited[nx][ny]) {
                dfs(nx, ny);
            }
        }
    }
}

import java.util.Scanner;

public class Main {
    private static int[][] map;
    private static boolean[][] visited;
    private static int w, h;

    private static int[] dx = {-1, -1, -1, 0, 0, 1, 1, 1};
    private static int[] dy = {-1, 0, 1, -1, 1, -1, 0, 1};

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        while (true) {
            w = scanner.nextInt();
            h = scanner.nextInt();

            if (w == 0 && h == 0) break;

            map = new int[h][w];
            visited = new boolean[h][w];

            for (int i = 0; i < h; i++) {
                for (int j = 0; j < w; j++) {
                    map[i][j] = scanner.nextInt();
                }
            }

            int islands = 0;
            for (int i = 0; i < h; i++) {
                for (int j = 0; j < w; j++) {
                    if (map[i][j] == 1 && !visited[i][j]) {
                        dfs(i, j);
                        islands++;
                    }
                }
            }

            System.out.println(islands);
        }

        scanner.close();
    }

    private static void dfs(int x, int y) {
        visited[x][y] = true;

        for (int i = 0; i < 8; i++) {
            int nx = x + dx[i];
            int ny = y + dy[i];

            if (nx >= 0 && nx < h && ny >= 0 && ny < w &&
                map[nx][ny] == 1 && !visited[nx][ny]) {
                dfs(nx, ny);
            }
        }
    }
}

import java.util.Scanner;

public class Main {
    private static int[][] map;
    private static boolean[][] visited;
    private static int w, h;
    private static int[] dx = {-1, -1, -1, 0, 0, 1, 1, 1};
    private static int[] dy = {-1, 0, 1, -1, 1, -1, 0, 1};

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            w = sc.nextInt();
            h = sc.nextInt();

            if (w == 0 && h == 0) break;

            map = new int[h][w];
            visited = new boolean[h][w];

            for (int i = 0; i < h; i++) {
                for (int j = 0; j < w; j++) {
                    map[i][j] = sc.nextInt();
                }
            }

            int islands = 0;
            for (int i = 0; i < h; i++) {
                for (int j = 0; j < w; j++) {
                    if (map[i][j] == 1 && !visited[i][j]) {
                        dfs(i, j);
                        islands++;
                    }
                }
            }

            System.out.println(islands);
        }

        sc.close();
    }

    private static void dfs(int y, int x) {
        visited[y][x] = true;

        for (int i = 0; i < 8; i++) {
            int ny = y + dy[i];
            int nx = x + dx[i];

            if (ny >= 0 && ny < h && nx >= 0 && nx < w &&
                map[ny][nx] == 1 && !visited[ny][nx]) {
                dfs(ny, nx);
            }
        }
    }
}

import java.util.*;

public class Main {
    static int gcd(int a, int b) {
        while (b != 0) {
            int temp = b;
            b = a % b;
            a = temp;
        }
        return a;
    }

    static boolean canPair(int blue, int red) {
        return gcd(blue, red) > 1;
    }

    static boolean dfs(int u, List<List<Integer>> graph, int[] match, boolean[] visited) {
        for (int v : graph.get(u)) {
            if (visited[v]) continue;
            visited[v] = true;

            if (match[v] == -1 || dfs(match[v], graph, match, visited)) {
                match[v] = u;
                return true;
            }
        }
        return false;
    }

    static int maxMatching(int[] blue, int[] red) {
        int m = blue.length;
        int n = red.length;

        List<List<Integer>> graph = new ArrayList<>();
        for (int i = 0; i < m; i++) {
            graph.add(new ArrayList<>());
            for (int j = 0; j < n; j++) {
                if (canPair(blue[i], red[j])) {
                    graph.get(i).add(j);
                }
            }
        }

        int[] match = new int[n];
        Arrays.fill(match, -1);

        int result = 0;
        for (int i = 0; i < m; i++) {
            boolean[] visited = new boolean[n];
            if (dfs(i, graph, match, visited)) {
                result++;
            }
        }

        return result;
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int m = sc.nextInt();
            int n = sc.nextInt();

            if (m == 0 && n == 0) break;

            int[] blue = new int[m];
            int[] red = new int[n];

            for (int i = 0; i < m; i++) {
                blue[i] = sc.nextInt();
            }

            for (int i = 0; i < n; i++) {
                red[i] = sc.nextInt();
            }

            System.out.println(maxMatching(blue, red));
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    static int gcd(int a, int b) {
        while (b != 0) {
            int temp = b;
            b = a % b;
            a = temp;
        }
        return a;
    }

    static boolean canPair(int blue, int red) {
        return gcd(blue, red) > 1;
    }

    static boolean dfs(int u, List<List<Integer>> graph, int[] match, boolean[] visited) {
        for (int v : graph.get(u)) {
            if (visited[v]) continue;
            visited[v] = true;

            if (match[v] == -1 || dfs(match[v], graph, match, visited)) {
                match[v] = u;
                return true;
            }
        }
        return false;
    }

    static int maxMatching(int[] blue, int[] red) {
        int m = blue.length;
        int n = red.length;

        List<List<Integer>> graph = new ArrayList<>();
        for (int i = 0; i < m; i++) {
            graph.add(new ArrayList<>());
            for (int j = 0; j < n; j++) {
                if (canPair(blue[i], red[j])) {
                    graph.get(i).add(j);
                }
            }
        }

        int[] match = new int[n];
        Arrays.fill(match, -1);

        int result = 0;
        for (int i = 0; i < m; i++) {
            boolean[] visited = new boolean[n];
            if (dfs(i, graph, match, visited)) {
                result++;
            }
        }

        return result;
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int m = sc.nextInt();
            int n = sc.nextInt();

            if (m == 0 && n == 0) break;

            int[] blue = new int[m];
            int[] red = new int[n];

            for (int i = 0; i < m; i++) {
                blue[i] = sc.nextInt();
            }

            for (int i = 0; i < n; i++) {
                red[i] = sc.nextInt();
            }

            System.out.println(maxMatching(blue, red));
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            if (n == 0) break;

            Map<Integer, int[]> positions = new HashMap<>();
            positions.put(0, new int[]{0, 0});

            for (int i = 1; i < n; i++) {
                int ni = sc.nextInt();
                int di = sc.nextInt();

                int[] refPos = positions.get(ni);
                int[] newPos = new int[2];

                switch (di) {
                    case 0:
                        newPos[0] = refPos[0] - 1;
                        newPos[1] = refPos[1];
                        break;
                    case 1:
                        newPos[0] = refPos[0];
                        newPos[1] = refPos[1] - 1;
                        break;
                    case 2:
                        newPos[0] = refPos[0] + 1;
                        newPos[1] = refPos[1];
                        break;
                    case 3:
                        newPos[0] = refPos[0];
                        newPos[1] = refPos[1] + 1;
                        break;
                }

                positions.put(i, newPos);
            }

            int minX = Integer.MAX_VALUE, maxX = Integer.MIN_VALUE;
            int minY = Integer.MAX_VALUE, maxY = Integer.MIN_VALUE;

            for (int[] pos : positions.values()) {
                minX = Math.min(minX, pos[0]);
                maxX = Math.max(maxX, pos[0]);
                minY = Math.min(minY, pos[1]);
                maxY = Math.max(maxY, pos[1]);
            }

            int width = maxX - minX + 1;
            int height = maxY - minY + 1;

            System.out.println(width + " " + height);
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            if (n == 0) break;

            Map<Integer, int[]> positions = new HashMap<>();
            positions.put(0, new int[]{0, 0});

            for (int i = 1; i < n; i++) {
                int target = sc.nextInt();
                int direction = sc.nextInt();

                int[] targetPos = positions.get(target);
                int[] newPos = new int[2];

                switch (direction) {
                    case 0:
                        newPos[0] = targetPos[0] - 1;
                        newPos[1] = targetPos[1];
                        break;
                    case 1:
                        newPos[0] = targetPos[0];
                        newPos[1] = targetPos[1] - 1;
                        break;
                    case 2:
                        newPos[0] = targetPos[0] + 1;
                        newPos[1] = targetPos[1];
                        break;
                    case 3:
                        newPos[0] = targetPos[0];
                        newPos[1] = targetPos[1] + 1;
                        break;
                }

                positions.put(i, newPos);
            }

            int minX = Integer.MAX_VALUE, maxX = Integer.MIN_VALUE;
            int minY = Integer.MAX_VALUE, maxY = Integer.MIN_VALUE;

            for (int[] pos : positions.values()) {
                minX = Math.min(minX, pos[0]);
                maxX = Math.max(maxX, pos[0]);
                minY = Math.min(minY, pos[1]);
                maxY = Math.max(maxY, pos[1]);
            }

            int width = maxX - minX + 1;
            int height = maxY - minY + 1;

            System.out.println(width + " " + height);
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            if (n == 0) break;

            Map<Integer, int[]> positions = new HashMap<>();
            positions.put(0, new int[]{0, 0});

            for (int i = 1; i < n; i++) {
                int refSquare = sc.nextInt();
                int direction = sc.nextInt();

                int[] refPos = positions.get(refSquare);
                int[] newPos = new int[2];

                switch (direction) {
                    case 0:
                        newPos[0] = refPos[0] - 1;
                        newPos[1] = refPos[1];
                        break;
                    case 1:
                        newPos[0] = refPos[0];
                        newPos[1] = refPos[1] - 1;
                        break;
                    case 2:
                        newPos[0] = refPos[0] + 1;
                        newPos[1] = refPos[1];
                        break;
                    case 3:
                        newPos[0] = refPos[0];
                        newPos[1] = refPos[1] + 1;
                        break;
                }

                positions.put(i, newPos);
            }

            int minX = Integer.MAX_VALUE, maxX = Integer.MIN_VALUE;
            int minY = Integer.MAX_VALUE, maxY = Integer.MIN_VALUE;

            for (int[] pos : positions.values()) {
                minX = Math.min(minX, pos[0]);
                maxX = Math.max(maxX, pos[0]);
                minY = Math.min(minY, pos[1]);
                maxY = Math.max(maxY, pos[1]);
            }

            int width = maxX - minX + 1;
            int height = maxY - minY + 1;

            System.out.println(width + " " + height);
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        while (true) {
            String line = scanner.nextLine();
            if (line.equals(".")) {
                break;
            }

            String input = line.substring(0, line.length() - 1);

            if (isBalanced(input)) {
                System.out.println("yes");
            } else {
                System.out.println("no");
            }
        }

        scanner.close();
    }

    private static boolean isBalanced(String s) {
        Stack<Character> stack = new Stack<>();

        for (char c : s.toCharArray()) {
            if (c == '(' || c == '[') {
                stack.push(c);
            } else if (c == ')' || c == ']') {
                if (stack.isEmpty()) {
                    return false;
                }

                char top = stack.pop();
                if ((c == ')' && top != '(') || (c == ']' && top != '[')) {
                    return false;
                }
            }
        }

        return stack.isEmpty();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        while (true) {
            String line = scanner.nextLine();
            if (line.equals(".")) {
                break;
            }

            String input = line.substring(0, line.length() - 1);

            if (isBalanced(input)) {
                System.out.println("yes");
            } else {
                System.out.println("no");
            }
        }

        scanner.close();
    }

    private static boolean isBalanced(String s) {
        Stack<Character> stack = new Stack<>();

        for (char c : s.toCharArray()) {
            if (c == '(' || c == '[') {
                stack.push(c);
            } else if (c == ')' || c == ']') {
                if (stack.isEmpty()) {
                    return false;
                }

                char top = stack.pop();
                if ((c == ')' && top != '(') || (c == ']' && top != '[')) {
                    return false;
                }
            }
        }

        return stack.isEmpty();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        while (true) {
            String line = scanner.nextLine();
            if (line.equals(".")) {
                break;
            }

            String input = line.substring(0, line.length() - 1);

            if (isBalanced(input)) {
                System.out.println("yes");
            } else {
                System.out.println("no");
            }
        }

        scanner.close();
    }

    private static boolean isBalanced(String s) {
        Stack<Character> stack = new Stack<>();

        for (char c : s.toCharArray()) {
            if (c == '(' || c == '[') {
                stack.push(c);
            } else if (c == ')' || c == ']') {
                if (stack.isEmpty()) {
                    return false;
                }

                char top = stack.pop();
                if ((c == ')' && top != '(') || (c == ']' && top != '[')) {
                    return false;
                }
            }
        }

        return stack.isEmpty();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        while (true) {
            String line = scanner.nextLine();
            if (line.equals(".")) {
                break;
            }

            String input = line.substring(0, line.length() - 1);

            if (isBalanced(input)) {
                System.out.println("yes");
            } else {
                System.out.println("no");
            }
        }

        scanner.close();
    }

    private static boolean isBalanced(String s) {
        Stack<Character> stack = new Stack<>();

        for (char c : s.toCharArray()) {
            if (c == '(' || c == '[') {
                stack.push(c);
            } else if (c == ')' || c == ']') {
                if (stack.isEmpty()) {
                    return false;
                }

                char top = stack.pop();
                if ((c == ')' && top != '(') || (c == ']' && top != '[')) {
                    return false;
                }
            }
        }

        return stack.isEmpty();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        while (true) {
            String line = scanner.nextLine();
            if (line.equals(".")) {
                break;
            }

            String input = line.substring(0, line.length() - 1);

            if (isBalanced(input)) {
                System.out.println("yes");
            } else {
                System.out.println("no");
            }
        }

        scanner.close();
    }

    private static boolean isBalanced(String s) {
        Stack<Character> stack = new Stack<>();

        for (char c : s.toCharArray()) {
            if (c == '(' || c == '[') {
                stack.push(c);
            } else if (c == ')' || c == ']') {
                if (stack.isEmpty()) {
                    return false;
                }

                char top = stack.pop();
                if ((c == ')' && top != '(') || (c == ']' && top != '[')) {
                    return false;
                }
            }
        }

        return stack.isEmpty();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int a0 = sc.nextInt();
            int L = sc.nextInt();

            if (a0 == 0 && L == 0) break;

            Map<Integer, Integer> seen = new HashMap<>();
            int current = a0;
            int index = 0;

            while (true) {
                if (seen.containsKey(current)) {
                    int j = seen.get(current);
                    System.out.println(j + " " + current + " " + (index - j));
                    break;
                }

                seen.put(current, index);
                current = nextValue(current, L);
                index++;
            }
        }

        sc.close();
    }

    private static int nextValue(int num, int L) {
        String str = String.format("%0" + L + "d", num);
        char[] digits = str.toCharArray();

        Arrays.sort(digits);
        StringBuilder minStr = new StringBuilder();
        for (char c : digits) {
            minStr.append(c);
        }
        int min = Integer.parseInt(minStr.toString());

        StringBuilder maxStr = new StringBuilder();
        for (int i = digits.length - 1; i >= 0; i--) {
            maxStr.append(digits[i]);
        }
        int max = Integer.parseInt(maxStr.toString());

        return max - min;
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int a0 = sc.nextInt();
            int L = sc.nextInt();

            if (a0 == 0 && L == 0) break;

            Map<Integer, Integer> seen = new HashMap<>();
            int current = a0;
            int index = 0;

            while (true) {
                if (seen.containsKey(current)) {
                    int j = seen.get(current);
                    System.out.println(j + " " + current + " " + (index - j));
                    break;
                }

                seen.put(current, index);
                current = nextValue(current, L);
                index++;
            }
        }

        sc.close();
    }

    private static int nextValue(int num, int L) {
        String str = String.format("%0" + L + "d", num);
        char[] digits = str.toCharArray();

        Arrays.sort(digits);
        StringBuilder minStr = new StringBuilder();
        for (char c : digits) {
            minStr.append(c);
        }
        int min = Integer.parseInt(minStr.toString());

        StringBuilder maxStr = new StringBuilder();
        for (int i = digits.length - 1; i >= 0; i--) {
            maxStr.append(digits[i]);
        }
        int max = Integer.parseInt(maxStr.toString());

        return max - min;
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int x = sc.nextInt();
            int y = sc.nextInt();
            int s = sc.nextInt();

            if (x == 0 && y == 0 && s == 0) break;

            int maxAfterTax = 0;

            for (int p1 = 1; p1 < s; p1++) {
                for (int p2 = 1; p2 < s; p2++) {
                    int oldPrice1 = (int) Math.round(p1 * (100 + x) / 100.0);
                    int oldPrice2 = (int) Math.round(p2 * (100 + x) / 100.0);

                    if (oldPrice1 + oldPrice2 == s) {
                        int newPrice1 = (int) Math.round(p1 * (100 + y) / 100.0);
                        int newPrice2 = (int) Math.round(p2 * (100 + y) / 100.0);
                        int newTotal = newPrice1 + newPrice2;

                        maxAfterTax = Math.max(maxAfterTax, newTotal);
                    }
                }
            }

            System.out.println(maxAfterTax);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int x = sc.nextInt();
            int y = sc.nextInt();
            int s = sc.nextInt();

            if (x == 0 && y == 0 && s == 0) break;

            int maxAfterTax = 0;

            for (int p1 = 1; p1 < s; p1++) {
                for (int p2 = 1; p2 < s; p2++) {
                    int afterTax1Old = (int) Math.round(p1 * (100.0 + x) / 100.0);
                    int afterTax2Old = (int) Math.round(p2 * (100.0 + x) / 100.0);

                    if (afterTax1Old + afterTax2Old == s) {
                        int afterTax1New = (int) Math.round(p1 * (100.0 + y) / 100.0);
                        int afterTax2New = (int) Math.round(p2 * (100.0 + y) / 100.0);

                        int totalNew = afterTax1New + afterTax2New;
                        maxAfterTax = Math.max(maxAfterTax, totalNew);
                    }
                }
            }

            System.out.println(maxAfterTax);
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int H = sc.nextInt();
            if (H == 0) break;

            int[][] board = new int[H][5];
            for (int i = 0; i < H; i++) {
                for (int j = 0; j < 5; j++) {
                    board[i][j] = sc.nextInt();
                }
            }

            int totalScore = 0;

            while (true) {
                boolean[][] toDisappear = new boolean[H][5];
                boolean found = false;

                for (int i = 0; i < H; i++) {
                    for (int j = 0; j < 5; j++) {
                        if (board[i][j] == 0) continue;

                        int count = 1;
                        int k = j + 1;
                        while (k < 5 && board[i][k] == board[i][j]) {
                            count++;
                            k++;
                        }

                        if (count >= 3) {
                            for (int l = j; l < j + count; l++) {
                                toDisappear[i][l] = true;
                            }
                            found = true;
                        }
                    }
                }

                if (!found) break;

                for (int i = 0; i < H; i++) {
                    for (int j = 0; j < 5; j++) {
                        if (toDisappear[i][j]) {
                            totalScore += board[i][j];
                            board[i][j] = 0;
                        }
                    }
                }

                for (int j = 0; j < 5; j++) {
                    int writePos = H - 1;
                    for (int i = H - 1; i >= 0; i--) {
                        if (board[i][j] != 0) {
                            board[writePos][j] = board[i][j];
                            if (writePos != i) {
                                board[i][j] = 0;
                            }
                            writePos--;
                        }
                    }
                }
            }

            System.out.println(totalScore);
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int H = sc.nextInt();
            if (H == 0) break;

            int[][] board = new int[H][5];
            for (int i = 0; i < H; i++) {
                for (int j = 0; j < 5; j++) {
                    board[i][j] = sc.nextInt();
                }
            }

            int totalScore = 0;

            while (true) {
                boolean[][] toRemove = new boolean[H][5];
                boolean found = false;

                for (int i = 0; i < H; i++) {
                    for (int j = 0; j < 5; j++) {
                        if (board[i][j] == 0) continue;

                        int count = 1;
                        int k = j + 1;
                        while (k < 5 && board[i][k] == board[i][j]) {
                            count++;
                            k++;
                        }

                        if (count >= 3) {
                            for (int l = j; l < j + count; l++) {
                                toRemove[i][l] = true;
                            }
                            found = true;
                        }
                    }
                }

                if (!found) break;

                for (int i = 0; i < H; i++) {
                    for (int j = 0; j < 5; j++) {
                        if (toRemove[i][j]) {
                            totalScore += board[i][j];
                            board[i][j] = 0;
                        }
                    }
                }

                for (int j = 0; j < 5; j++) {
                    int writePos = H - 1;
                    for (int i = H - 1; i >= 0; i--) {
                        if (board[i][j] != 0) {
                            board[writePos][j] = board[i][j];
                            if (writePos != i) {
                                board[i][j] = 0;
                            }
                            writePos--;
                        }
                    }
                }
            }

            System.out.println(totalScore);
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int maxN = 32768;
        boolean[] isPrime = new boolean[maxN];
        Arrays.fill(isPrime, true);
        isPrime[0] = isPrime[1] = false;

        for (int i = 2; i * i < maxN; i++) {
            if (isPrime[i]) {
                for (int j = i * i; j < maxN; j += i) {
                    isPrime[j] = false;
                }
            }
        }

        int n;
        while ((n = sc.nextInt()) != 0) {
            int count = 0;
            for (int p1 = 2; p1 <= n / 2; p1++) {
                if (isPrime[p1] && isPrime[n - p1]) {
                    count++;
                }
            }
            System.out.println(count);
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int maxN = 32768;
        boolean[] isPrime = new boolean[maxN];
        Arrays.fill(isPrime, true);
        isPrime[0] = isPrime[1] = false;

        for (int i = 2; i * i < maxN; i++) {
            if (isPrime[i]) {
                for (int j = i * i; j < maxN; j += i) {
                    isPrime[j] = false;
                }
            }
        }

        int n;
        while ((n = sc.nextInt()) != 0) {
            int count = 0;

            for (int p1 = 2; p1 <= n / 2; p1++) {
                if (isPrime[p1] && isPrime[n - p1]) {
                    count++;
                }
            }

            System.out.println(count);
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int maxN = 32768;
        boolean[] isPrime = new boolean[maxN + 1];
        Arrays.fill(isPrime, true);
        isPrime[0] = isPrime[1] = false;

        for (int i = 2; i * i <= maxN; i++) {
            if (isPrime[i]) {
                for (int j = i * i; j <= maxN; j += i) {
                    isPrime[j] = false;
                }
            }
        }

        int n;
        while ((n = sc.nextInt()) != 0) {
            int count = 0;

            for (int p1 = 2; p1 <= n / 2; p1++) {
                if (isPrime[p1]) {
                    int p2 = n - p1;
                    if (isPrime[p2]) {
                        count++;
                    }
                }
            }

            System.out.println(count);
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int maxN = 32768;
        boolean[] isPrime = new boolean[maxN + 1];
        Arrays.fill(isPrime, true);
        isPrime[0] = isPrime[1] = false;

        for (int i = 2; i * i <= maxN; i++) {
            if (isPrime[i]) {
                for (int j = i * i; j <= maxN; j += i) {
                    isPrime[j] = false;
                }
            }
        }

        int n;
        while ((n = sc.nextInt()) != 0) {
            int count = 0;

            for (int p1 = 2; p1 <= n / 2; p1++) {
                if (isPrime[p1]) {
                    int p2 = n - p1;
                    if (isPrime[p2]) {
                        count++;
                    }
                }
            }

            System.out.println(count);
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int maxN = 32768;
        boolean[] isPrime = new boolean[maxN + 1];
        Arrays.fill(isPrime, true);
        isPrime[0] = isPrime[1] = false;

        for (int i = 2; i * i <= maxN; i++) {
            if (isPrime[i]) {
                for (int j = i * i; j <= maxN; j += i) {
                    isPrime[j] = false;
                }
            }
        }

        int n;
        while ((n = sc.nextInt()) != 0) {
            int count = 0;

            for (int p1 = 2; p1 <= n / 2; p1++) {
                if (isPrime[p1]) {
                    int p2 = n - p1;
                    if (isPrime[p2]) {
                        count++;
                    }
                }
            }

            System.out.println(count);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            if (n == 0) break;

            System.out.println(countRepresentations(n));
        }
        sc.close();
    }

    static int countRepresentations(int n) {
        int count = 0;
        int maxSqrt = (int) Math.sqrt(n);

        for (int a = 1; a <= maxSqrt; a++) {
            if (a * a == n) {
                count++;
                break;
            }
        }

        for (int a = 1; a * a <= n; a++) {
            int remaining = n - a * a;
            int b = (int) Math.sqrt(remaining);
            if (b >= a && b * b == remaining) {
                count++;
            }
        }

        for (int a = 1; a * a <= n; a++) {
            for (int b = a; a * a + b * b <= n; b++) {
                int remaining = n - a * a - b * b;
                int c = (int) Math.sqrt(remaining);
                if (c >= b && c * c == remaining) {
                    count++;
                }
            }
        }

        for (int a = 1; a * a <= n; a++) {
            for (int b = a; a * a + b * b <= n; b++) {
                for (int c = b; a * a + b * b + c * c <= n; c++) {
                    int remaining = n - a * a - b * b - c * c;
                    int d = (int) Math.sqrt(remaining);
                    if (d >= c && d * d == remaining) {
                        count++;
                    }
                }
            }
        }

        return count;
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            if (n == 0) break;

            System.out.println(countRepresentations(n));
        }

        sc.close();
    }

    static int countRepresentations(int n) {
        int count = 0;
        int maxSquare = (int) Math.sqrt(n);

        for (int a = 1; a <= maxSquare; a++) {
            if (a * a == n) {
                count++;
                break;
            }
        }

        for (int a = 1; a * a <= n; a++) {
            int remaining = n - a * a;
            int b = (int) Math.sqrt(remaining);
            if (b >= a && b * b == remaining) {
                count++;
            }
        }

        for (int a = 1; a * a <= n; a++) {
            for (int b = a; a * a + b * b <= n; b++) {
                int remaining = n - a * a - b * b;
                int c = (int) Math.sqrt(remaining);
                if (c >= b && c * c == remaining) {
                    count++;
                }
            }
        }

        for (int a = 1; a * a <= n; a++) {
            for (int b = a; a * a + b * b <= n; b++) {
                for (int c = b; a * a + b * b + c * c <= n; c++) {
                    int remaining = n - a * a - b * b - c * c;
                    int d = (int) Math.sqrt(remaining);
                    if (d >= c && d * d == remaining) {
                        count++;
                    }
                }
            }
        }

        return count;
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        boolean[] isPrime = new boolean[10001];
        Arrays.fill(isPrime, true);
        isPrime[0] = isPrime[1] = false;

        for (int i = 2; i * i <= 10000; i++) {
            if (isPrime[i]) {
                for (int j = i * i; j <= 10000; j += i) {
                    isPrime[j] = false;
                }
            }
        }

        List<Integer> primes = new ArrayList<>();
        for (int i = 2; i <= 10000; i++) {
            if (isPrime[i]) {
                primes.add(i);
            }
        }

        int n;
        while ((n = sc.nextInt()) != 0) {
            int count = 0;

            for (int start = 0; start < primes.size(); start++) {
                int sum = 0;
                for (int end = start; end < primes.size(); end++) {
                    sum += primes.get(end);
                    if (sum == n) {
                        count++;
                        break;
                    } else if (sum > n) {
                        break;
                    }
                }
            }

            System.out.println(count);
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        boolean[] isPrime = new boolean[10001];
        Arrays.fill(isPrime, true);
        isPrime[0] = isPrime[1] = false;

        for (int i = 2; i * i <= 10000; i++) {
            if (isPrime[i]) {
                for (int j = i * i; j <= 10000; j += i) {
                    isPrime[j] = false;
                }
            }
        }

        List<Integer> primes = new ArrayList<>();
        for (int i = 2; i <= 10000; i++) {
            if (isPrime[i]) {
                primes.add(i);
            }
        }

        int n;
        while ((n = sc.nextInt()) != 0) {
            int count = 0;

            for (int start = 0; start < primes.size(); start++) {
                int sum = 0;
                for (int end = start; end < primes.size(); end++) {
                    sum += primes.get(end);
                    if (sum == n) {
                        count++;
                        break;
                    } else if (sum > n) {
                        break;
                    }
                }
            }

            System.out.println(count);
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int N = sc.nextInt();
            int T = sc.nextInt();
            int L = sc.nextInt();
            int B = sc.nextInt();

            if (N == 0 && T == 0 && L == 0 && B == 0) break;

            Set<Integer> loseSquares = new HashSet<>();
            Set<Integer> backSquares = new HashSet<>();

            for (int i = 0; i < L; i++) {
                loseSquares.add(sc.nextInt());
            }

            for (int i = 0; i < B; i++) {
                backSquares.add(sc.nextInt());
            }

            double[][][] dp = new double[T + 1][N + 1][2];
            dp[0][0][1] = 1.0;

            for (int turn = 0; turn < T; turn++) {
                for (int pos = 0; pos <= N; pos++) {
                    if (dp[turn][pos][1] > 0) {
                        for (int dice = 1; dice <= 6; dice++) {
                            int newPos = pos + dice;

                            if (newPos > N) {
                                newPos = N - (newPos - N);
                            }

                            double prob = dp[turn][pos][1] / 6.0;

                            if (newPos == N) {
                                dp[turn + 1][newPos][1] += prob;
                            } else if (backSquares.contains(newPos)) {
                                dp[turn + 1][0][1] += prob;
                            } else if (loseSquares.contains(newPos)) {
                                dp[turn + 1][newPos][0] += prob;
                            } else {
                                dp[turn + 1][newPos][1] += prob;
                            }
                        }
                    }

                    if (dp[turn][pos][0] > 0) {
                        dp[turn + 1][pos][1] += dp[turn][pos][0];
                    }
                }
            }

            double result = 0.0;
            for (int turn = 1; turn <= T; turn++) {
                result += dp[turn][N][1] + dp[turn][N][0];
            }

            System.out.printf("%.6f%n", result);
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int N = sc.nextInt();
            int T = sc.nextInt();
            int L = sc.nextInt();
            int B = sc.nextInt();

            if (N == 0 && T == 0 && L == 0 && B == 0) break;

            Set<Integer> loseSquares = new HashSet<>();
            Set<Integer> backSquares = new HashSet<>();

            for (int i = 0; i < L; i++) {
                loseSquares.add(sc.nextInt());
            }

            for (int i = 0; i < B; i++) {
                backSquares.add(sc.nextInt());
            }

            double[][][] dp = new double[T + 1][N + 1][2];
            dp[0][0][1] = 1.0;

            for (int turn = 0; turn < T; turn++) {
                for (int pos = 0; pos <= N; pos++) {
                    if (dp[turn][pos][1] > 0) {
                        for (int dice = 1; dice <= 6; dice++) {
                            int newPos = pos + dice;

                            if (newPos > N) {
                                newPos = N - (newPos - N);
                            }

                            double prob = dp[turn][pos][1] / 6.0;

                            if (newPos == N) {
                                dp[turn + 1][N][1] += prob;
                            } else if (backSquares.contains(newPos)) {
                                dp[turn + 1][0][1] += prob;
                            } else if (loseSquares.contains(newPos)) {
                                dp[turn + 1][newPos][0] += prob;
                            } else {
                                dp[turn + 1][newPos][1] += prob;
                            }
                        }
                    }

                    if (dp[turn][pos][0] > 0) {
                        dp[turn + 1][pos][1] += dp[turn][pos][0];
                    }
                }
            }

            double result = 0.0;
            for (int turn = 1; turn <= T; turn++) {
                result += dp[turn][N][1] + dp[turn][N][0];
            }

            System.out.printf("%.6f%n", result);
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            int w = sc.nextInt();

            if (n == 0 && w == 0) break;

            int[] values = new int[n];
            int maxValue = 0;

            for (int i = 0; i < n; i++) {
                values[i] = sc.nextInt();
                maxValue = Math.max(maxValue, values[i]);
            }

            int numIntervals = (maxValue / w) + 1;

            int[] frequencies = new int[numIntervals];
            for (int value : values) {
                int intervalIndex = value / w;
                frequencies[intervalIndex]++;
            }

            int maxFreq = 0;
            for (int freq : frequencies) {
                maxFreq = Math.max(maxFreq, freq);
            }

            double totalInk = 0.01;

            for (int i = 0; i < numIntervals; i++) {
                if (frequencies[i] > 0) {
                    double height = (double) frequencies[i] / maxFreq;

                    double darkness = 1.0 - (double) i / (numIntervals - 1);

                    double ink = w * height * darkness;
                    totalInk += ink;
                }
            }

            System.out.println(totalInk);
        }

        sc.close();
    }
}

import java.util.*;

public class GreyArea {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            int w = sc.nextInt();

            if (n == 0 && w == 0) break;

            int[] values = new int[n];
            int maxValue = 0;

            for (int i = 0; i < n; i++) {
                values[i] = sc.nextInt();
                maxValue = Math.max(maxValue, values[i]);
            }

            int numIntervals = (maxValue / w) + 1;

            int[] frequencies = new int[numIntervals];
            for (int value : values) {
                int intervalIndex = value / w;
                frequencies[intervalIndex]++;
            }

            int maxFreq = 0;
            for (int freq : frequencies) {
                maxFreq = Math.max(maxFreq, freq);
            }

            double totalInk = 0.01;

            for (int i = 0; i < numIntervals; i++) {
                if (frequencies[i] > 0) {
                    double height = (double) frequencies[i] / maxFreq;

                    double darkness = 1.0 - (double) i / (numIntervals - 1);

                    double ink = w * height * darkness;
                    totalInk += ink;
                }
            }

            System.out.println(totalInk);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            int m = sc.nextInt();
            int k = sc.nextInt();

            if (n == 0 && m == 0 && k == 0) break;

            double[][] dp = new double[n + 1][n * m + 1];
            dp[0][0] = 1.0;

            for (int i = 1; i <= n; i++) {
                for (int j = i; j <= i * m; j++) {
                    for (int face = 1; face <= m && face <= j; face++) {
                        dp[i][j] += dp[i - 1][j - face] / m;
                    }
                }
            }

            double expected = 0.0;
            for (int sum = n; sum <= n * m; sum++) {
                int bills = Math.max(1, sum - k);
                expected += bills * dp[n][sum];
            }

            System.out.printf("%.8f\n", expected);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            int m = sc.nextInt();
            int k = sc.nextInt();

            if (n == 0 && m == 0 && k == 0) break;

            double[][] dp = new double[n + 1][n * m + 1];
            dp[0][0] = 1.0;

            for (int i = 1; i <= n; i++) {
                for (int j = i; j <= i * m; j++) {
                    for (int face = 1; face <= m && face <= j; face++) {
                        dp[i][j] += dp[i - 1][j - face] / m;
                    }
                }
            }

            double expected = 0.0;
            for (int sum = n; sum <= n * m; sum++) {
                int bills = Math.max(1, sum - k);
                expected += bills * dp[n][sum];
            }

            System.out.printf("%.8f\n", expected);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int w = sc.nextInt();
            int d = sc.nextInt();

            if (w == 0 && d == 0) break;

            int[] front = new int[w];
            int[] side = new int[d];

            for (int i = 0; i < w; i++) {
                front[i] = sc.nextInt();
            }

            for (int i = 0; i < d; i++) {
                side[i] = sc.nextInt();
            }

            int totalCubes = 0;

            for (int i = 0; i < w; i++) {
                for (int j = 0; j < d; j++) {
                    totalCubes += Math.min(front[i], side[j]);
                }
            }

            System.out.println(totalCubes);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int w = sc.nextInt();
            int d = sc.nextInt();

            if (w == 0 && d == 0) break;

            int[] front = new int[w];
            int[] side = new int[d];

            for (int i = 0; i < w; i++) {
                front[i] = sc.nextInt();
            }

            for (int i = 0; i < d; i++) {
                side[i] = sc.nextInt();
            }

            int totalCubes = 0;
            for (int i = 0; i < w; i++) {
                for (int j = 0; j < d; j++) {
                    totalCubes += Math.min(front[i], side[j]);
                }
            }

            System.out.println(totalCubes);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int w = sc.nextInt();
            int d = sc.nextInt();

            if (w == 0 && d == 0) break;

            int[] front = new int[w];
            int[] side = new int[d];

            for (int i = 0; i < w; i++) {
                front[i] = sc.nextInt();
            }

            for (int i = 0; i < d; i++) {
                side[i] = sc.nextInt();
            }

            int totalCubes = 0;
            for (int i = 0; i < w; i++) {
                for (int j = 0; j < d; j++) {
                    totalCubes += Math.min(front[i], side[j]);
                }
            }

            System.out.println(totalCubes);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int w = sc.nextInt();
            int d = sc.nextInt();

            if (w == 0 && d == 0) break;

            int[] front = new int[w];
            int[] side = new int[d];

            for (int i = 0; i < w; i++) {
                front[i] = sc.nextInt();
            }

            for (int i = 0; i < d; i++) {
                side[i] = sc.nextInt();
            }

            int totalCubes = 0;

            for (int i = 0; i < w; i++) {
                for (int j = 0; j < d; j++) {
                    totalCubes += Math.min(front[i], side[j]);
                }
            }

            System.out.println(totalCubes);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            int k = sc.nextInt();
            int s = sc.nextInt();

            if (n == 0 && k == 0 && s == 0) break;

            System.out.println(countSets(n, k, s));
        }

        sc.close();
    }

    private static int countSets(int n, int k, int s) {
        int[][][] dp = new int[n + 1][k + 1][s + 1];

        for (int i = 0; i <= n; i++) {
            dp[i][0][0] = 1;
        }

        for (int i = 1; i <= n; i++) {
            for (int j = 0; j <= k; j++) {
                for (int sum = 0; sum <= s; sum++) {
                    dp[i][j][sum] = dp[i-1][j][sum];

                    if (j > 0 && sum >= i) {
                        dp[i][j][sum] += dp[i-1][j-1][sum-i];
                    }
                }
            }
        }

        return dp[n][k][s];
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            int k = sc.nextInt();
            int s = sc.nextInt();

            if (n == 0 && k == 0 && s == 0) break;

            System.out.println(countSets(n, k, s));
        }

        sc.close();
    }

    private static int countSets(int n, int k, int s) {
        int[][][] dp = new int[n + 1][k + 1][s + 1];

        for (int i = 0; i <= n; i++) {
            dp[i][0][0] = 1;
        }

        for (int i = 1; i <= n; i++) {
            for (int j = 0; j <= k; j++) {
                for (int sum = 0; sum <= s; sum++) {
                    dp[i][j][sum] = dp[i-1][j][sum];

                    if (j > 0 && sum >= i) {
                        dp[i][j][sum] += dp[i-1][j-1][sum-i];
                    }
                }
            }
        }

        return dp[n][k][s];
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String expression = sc.nextLine();
        int bobAnswer = sc.nextInt();

        int multiplicationFirst = evaluateMultiplicationFirst(expression);
        int leftToRight = evaluateLeftToRight(expression);

        boolean matchesM = (multiplicationFirst == bobAnswer);
        boolean matchesL = (leftToRight == bobAnswer);

        if (matchesM && matchesL) {
            System.out.println("U");
        } else if (matchesM) {
            System.out.println("M");
        } else if (matchesL) {
            System.out.println("L");
        } else {
            System.out.println("I");
        }
    }

    private static int evaluateMultiplicationFirst(String expr) {
        String temp = expr;
        while (temp.contains("*")) {
            int pos = temp.indexOf("*");
            int left = Character.getNumericValue(temp.charAt(pos - 1));
            int right = Character.getNumericValue(temp.charAt(pos + 1));
            int result = left * right;

            String before = temp.substring(0, pos - 1);
            String after = temp.substring(pos + 2);
            temp = before + result + after;
        }

        return evaluateLeftToRight(temp);
    }

    private static int evaluateLeftToRight(String expr) {
        int result = Character.getNumericValue(expr.charAt(0));

        for (int i = 1; i < expr.length(); i += 2) {
            char operator = expr.charAt(i);
            int operand = Character.getNumericValue(expr.charAt(i + 1));

            if (operator == '+') {
                result += operand;
            } else if (operator == '*') {
                result *= operand;
            }
        }

        return result;
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String expression = sc.nextLine();
        int bobAnswer = sc.nextInt();

        int multiplicationFirst = evaluateMultiplicationFirst(expression);
        int leftToRight = evaluateLeftToRight(expression);

        boolean matchesM = (multiplicationFirst == bobAnswer);
        boolean matchesL = (leftToRight == bobAnswer);

        if (matchesM && matchesL) {
            System.out.println("U");
        } else if (matchesM) {
            System.out.println("M");
        } else if (matchesL) {
            System.out.println("L");
        } else {
            System.out.println("I");
        }
    }

    private static int evaluateMultiplicationFirst(String expr) {
        String temp = expr;
        while (temp.contains("*")) {
            int pos = temp.indexOf("*");
            int left = Character.getNumericValue(temp.charAt(pos - 1));
            int right = Character.getNumericValue(temp.charAt(pos + 1));
            int result = left * right;

            String before = temp.substring(0, pos - 1);
            String after = temp.substring(pos + 2);
            temp = before + result + after;
        }

        return evaluateLeftToRight(temp);
    }

    private static int evaluateLeftToRight(String expr) {
        int result = Character.getNumericValue(expr.charAt(0));

        for (int i = 1; i < expr.length(); i += 2) {
            char operator = expr.charAt(i);
            int operand = Character.getNumericValue(expr.charAt(i + 1));

            if (operator == '+') {
                result += operand;
            } else if (operator == '*') {
                result *= operand;
            }
        }

        return result;
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String expression = sc.nextLine();
        int bobsAnswer = sc.nextInt();

        int multiplicationFirst = evaluateMultiplicationFirst(expression);
        int leftToRight = evaluateLeftToRight(expression);

        boolean mMatches = (multiplicationFirst == bobsAnswer);
        boolean lMatches = (leftToRight == bobsAnswer);

        if (mMatches && lMatches) {
            System.out.println("U");
        } else if (mMatches) {
            System.out.println("M");
        } else if (lMatches) {
            System.out.println("L");
        } else {
            System.out.println("I");
        }
    }

    private static int evaluateMultiplicationFirst(String expression) {
        String temp = expression;
        while (temp.contains("*")) {
            int starIndex = temp.indexOf("*");
            int left = Character.getNumericValue(temp.charAt(starIndex - 1));
            int right = Character.getNumericValue(temp.charAt(starIndex + 1));
            int product = left * right;

            String before = temp.substring(0, starIndex - 1);
            String after = temp.substring(starIndex + 2);
            temp = before + product + after;
        }

        return evaluateLeftToRight(temp);
    }

    private static int evaluateLeftToRight(String expression) {
        int result = Character.getNumericValue(expression.charAt(0));

        for (int i = 1; i < expression.length(); i += 2) {
            char operator = expression.charAt(i);
            int operand = Character.getNumericValue(expression.charAt(i + 1));

            if (operator == '+') {
                result += operand;
            } else if (operator == '*') {
                result *= operand;
            }
        }

        return result;
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] digits = new int[n];

        for (int i = 0; i < n; i++) {
            digits[i] = sc.nextInt();
        }

        Set<Integer> found = new HashSet<>();

        generateSubsequences(digits, 0, "", found);

        int result = 0;
        while (found.contains(result)) {
            result++;
        }

        System.out.println(result);
    }

    private static void generateSubsequences(int[] digits, int index, String current, Set<Integer> found) {
        if (!current.isEmpty()) {
            if (current.length() == 1 || current.charAt(0) != '0') {
                try {
                    int num = Integer.parseInt(current);
                    found.add(num);
                } catch (NumberFormatException e) {
                }
            } else if (current.equals("0")) {
                found.add(0);
            }
        }

        if (index >= digits.length) {
            return;
        }

        generateSubsequences(digits, index + 1, current + digits[index], found);

        generateSubsequences(digits, index + 1, current, found);
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] digits = new int[n];

        for (int i = 0; i < n; i++) {
            digits[i] = sc.nextInt();
        }

        Set<Integer> found = new HashSet<>();

        generateSubsequences(digits, 0, "", found);

        int result = 0;
        while (found.contains(result)) {
            result++;
        }

        System.out.println(result);
    }

    private static void generateSubsequences(int[] digits, int index, String current, Set<Integer> found) {
        if (!current.isEmpty()) {
            if (current.length() == 1 || current.charAt(0) != '0') {
                try {
                    int num = Integer.parseInt(current);
                    found.add(num);
                } catch (NumberFormatException e) {
                }
            } else if (current.equals("0")) {
                found.add(0);
            }
        }

        if (index >= digits.length) {
            return;
        }

        generateSubsequences(digits, index + 1, current + digits[index], found);

        generateSubsequences(digits, index + 1, current, found);
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] digits = new int[n];
        for (int i = 0; i < n; i++) {
            digits[i] = sc.nextInt();
        }

        Set<Integer> found = new HashSet<>();

        for (int mask = 1; mask < (1 << n); mask++) {
            StringBuilder sb = new StringBuilder();
            for (int i = 0; i < n; i++) {
                if ((mask & (1 << i)) != 0) {
                    sb.append(digits[i]);
                }
            }

            String numStr = sb.toString();
            if (numStr.length() > 1 && numStr.charAt(0) == '0') {
                continue;
            }

            try {
                int num = Integer.parseInt(numStr);
                found.add(num);
            } catch (NumberFormatException e) {
            }
        }

        int answer = 0;
        while (found.contains(answer)) {
            answer++;
        }

        System.out.println(answer);
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] digits = new int[n];
        for (int i = 0; i < n; i++) {
            digits[i] = sc.nextInt();
        }

        Set<Integer> found = new HashSet<>();

        for (int mask = 1; mask < (1 << n); mask++) {
            StringBuilder sb = new StringBuilder();
            for (int i = 0; i < n; i++) {
                if ((mask & (1 << i)) != 0) {
                    sb.append(digits[i]);
                }
            }

            String numStr = sb.toString();
            if (numStr.length() > 1 && numStr.charAt(0) == '0') {
                continue;
            }

            try {
                int num = Integer.parseInt(numStr);
                found.add(num);
            } catch (NumberFormatException e) {
            }
        }

        int answer = 0;
        while (found.contains(answer)) {
            answer++;
        }

        System.out.println(answer);
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            if (n == 0) break;

            int[] scores = new int[n];
            for (int i = 0; i < n; i++) {
                scores[i] = sc.nextInt();
            }

            Arrays.sort(scores);

            int minDiff = Integer.MAX_VALUE;
            for (int i = 0; i < n - 1; i++) {
                int diff = scores[i + 1] - scores[i];
                minDiff = Math.min(minDiff, diff);
            }

            System.out.println(minDiff);
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        while (true) {
            int n = scanner.nextInt();
            if (n == 0) break;

            int[] scores = new int[n];
            for (int i = 0; i < n; i++) {
                scores[i] = scanner.nextInt();
            }

            Arrays.sort(scores);

            int minDiff = Integer.MAX_VALUE;
            for (int i = 0; i < n - 1; i++) {
                int diff = scores[i + 1] - scores[i];
                minDiff = Math.min(minDiff, diff);
            }

            System.out.println(minDiff);
        }

        scanner.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            if (n == 0) break;

            int[] scores = new int[n];
            for (int i = 0; i < n; i++) {
                scores[i] = sc.nextInt();
            }

            Arrays.sort(scores);

            int minDiff = Integer.MAX_VALUE;
            for (int i = 0; i < n - 1; i++) {
                int diff = scores[i + 1] - scores[i];
                minDiff = Math.min(minDiff, diff);
            }

            System.out.println(minDiff);
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            if (n == 0) break;

            int[] scores = new int[n];
            for (int i = 0; i < n; i++) {
                scores[i] = sc.nextInt();
            }

            Arrays.sort(scores);

            int minDiff = Integer.MAX_VALUE;
            for (int i = 0; i < n - 1; i++) {
                int diff = scores[i + 1] - scores[i];
                minDiff = Math.min(minDiff, diff);
            }

            System.out.println(minDiff);
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            if (n == 0) break;

            int[] scores = new int[n];
            for (int i = 0; i < n; i++) {
                scores[i] = sc.nextInt();
            }

            Arrays.sort(scores);

            int minDiff = Integer.MAX_VALUE;
            for (int i = 0; i < n - 1; i++) {
                int diff = scores[i + 1] - scores[i];
                minDiff = Math.min(minDiff, diff);
            }

            System.out.println(minDiff);
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            int m = sc.nextInt();

            if (n == 0 && m == 0) break;

            int[] prices = new int[n];
            for (int i = 0; i < n; i++) {
                prices[i] = sc.nextInt();
            }

            int maxSum = -1;

            for (int i = 0; i < n; i++) {
                for (int j = i + 1; j < n; j++) {
                    int sum = prices[i] + prices[j];
                    if (sum <= m && sum > maxSum) {
                        maxSum = sum;
                    }
                }
            }

            if (maxSum == -1) {
                System.out.println("NONE");
            } else {
                System.out.println(maxSum);
            }
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            int m = sc.nextInt();

            if (n == 0 && m == 0) break;

            int[] prices = new int[n];
            for (int i = 0; i < n; i++) {
                prices[i] = sc.nextInt();
            }

            int maxSum = -1;

            for (int i = 0; i < n; i++) {
                for (int j = i + 1; j < n; j++) {
                    int sum = prices[i] + prices[j];
                    if (sum <= m && sum > maxSum) {
                        maxSum = sum;
                    }
                }
            }

            if (maxSum == -1) {
                System.out.println("NONE");
            } else {
                System.out.println(maxSum);
            }
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            int m = sc.nextInt();

            if (n == 0 && m == 0) break;

            int[] prices = new int[n];
            for (int i = 0; i < n; i++) {
                prices[i] = sc.nextInt();
            }

            Arrays.sort(prices);

            int maxSum = -1;
            int left = 0;
            int right = n - 1;

            while (left < right) {
                int sum = prices[left] + prices[right];
                if (sum <= m) {
                    maxSum = Math.max(maxSum, sum);
                    left++;
                } else {
                    right--;
                }
            }

            if (maxSum == -1) {
                System.out.println("NONE");
            } else {
                System.out.println(maxSum);
            }
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            int m = sc.nextInt();

            if (n == 0 && m == 0) break;

            int[] prices = new int[n];
            for (int i = 0; i < n; i++) {
                prices[i] = sc.nextInt();
            }

            Arrays.sort(prices);

            int maxSum = -1;
            int left = 0;
            int right = n - 1;

            while (left < right) {
                int sum = prices[left] + prices[right];
                if (sum <= m) {
                    maxSum = Math.max(maxSum, sum);
                    left++;
                } else {
                    right--;
                }
            }

            if (maxSum == -1) {
                System.out.println("NONE");
            } else {
                System.out.println(maxSum);
            }
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            int m = sc.nextInt();

            if (n == 0 && m == 0) break;

            int[] prices = new int[n];
            for (int i = 0; i < n; i++) {
                prices[i] = sc.nextInt();
            }

            Arrays.sort(prices);

            int maxSum = -1;

            int left = 0;
            int right = n - 1;

            while (left < right) {
                int sum = prices[left] + prices[right];

                if (sum <= m) {
                    maxSum = Math.max(maxSum, sum);
                    left++;
                } else {
                    right--;
                }
            }

            if (maxSum == -1) {
                System.out.println("NONE");
            } else {
                System.out.println(maxSum);
            }
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            String s1 = sc.nextLine();
            if (s1.equals(".")) break;
            String s2 = sc.nextLine();

            if (s1.equals(s2)) {
                System.out.println("IDENTICAL");
                continue;
            }

            List<String> literals1 = extractLiterals(s1);
            List<String> literals2 = extractLiterals(s2);
            String nonLiteral1 = removeStringLiterals(s1);
            String nonLiteral2 = removeStringLiterals(s2);

            if (!nonLiteral1.equals(nonLiteral2) || literals1.size() != literals2.size()) {
                System.out.println("DIFFERENT");
                continue;
            }

            int diffCount = 0;
            for (int i = 0; i < literals1.size(); i++) {
                if (!literals1.get(i).equals(literals2.get(i))) {
                    diffCount++;
                }
            }

            if (diffCount == 1) {
                System.out.println("CLOSE");
            } else {
                System.out.println("DIFFERENT");
            }
        }
    }

    private static List<String> extractLiterals(String s) {
        List<String> literals = new ArrayList<>();
        boolean inLiteral = false;
        StringBuilder current = new StringBuilder();

        for (char c : s.toCharArray()) {
            if (c == '"') {
                if (inLiteral) {
                    literals.add(current.toString());
                    current = new StringBuilder();
                }
                inLiteral = !inLiteral;
            } else if (inLiteral) {
                current.append(c);
            }
        }

        return literals;
    }

    private static String removeStringLiterals(String s) {
        StringBuilder result = new StringBuilder();
        boolean inLiteral = false;

        for (char c : s.toCharArray()) {
            if (c == '"') {
                inLiteral = !inLiteral;
                result.append(c);
            } else if (!inLiteral) {
                result.append(c);
            }
        }

        return result.toString();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            String s1 = sc.nextLine();
            if (s1.equals(".")) break;
            String s2 = sc.nextLine();

            if (s1.equals(s2)) {
                System.out.println("IDENTICAL");
                continue;
            }

            List<String> literals1 = extractStringLiterals(s1);
            List<String> literals2 = extractStringLiterals(s2);
            String nonLiteral1 = removeStringLiterals(s1);
            String nonLiteral2 = removeStringLiterals(s2);

            if (!nonLiteral1.equals(nonLiteral2) || literals1.size() != literals2.size()) {
                System.out.println("DIFFERENT");
                continue;
            }

            int diffCount = 0;
            for (int i = 0; i < literals1.size(); i++) {
                if (!literals1.get(i).equals(literals2.get(i))) {
                    diffCount++;
                }
            }

            if (diffCount == 1) {
                System.out.println("CLOSE");
            } else {
                System.out.println("DIFFERENT");
            }
        }
    }

    private static List<String> extractStringLiterals(String s) {
        List<String> literals = new ArrayList<>();
        boolean inString = false;
        StringBuilder current = new StringBuilder();

        for (char c : s.toCharArray()) {
            if (c == '"') {
                if (inString) {
                    literals.add(current.toString());
                    current = new StringBuilder();
                }
                inString = !inString;
            } else if (inString) {
                current.append(c);
            }
        }

        return literals;
    }

    private static String removeStringLiterals(String s) {
        StringBuilder result = new StringBuilder();
        boolean inString = false;

        for (char c : s.toCharArray()) {
            if (c == '"') {
                inString = !inString;
                result.append(c);
            } else if (!inString) {
                result.append(c);
            }
        }

        return result.toString();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        while (true) {
            int n = scanner.nextInt();
            if (n == 0) break;

            int[] incomes = new int[n];
            int sum = 0;

            for (int i = 0; i < n; i++) {
                incomes[i] = scanner.nextInt();
                sum += incomes[i];
            }

            double average = (double) sum / n;
            int count = 0;

            for (int i = 0; i < n; i++) {
                if (incomes[i] <= average) {
                    count++;
                }
            }

            System.out.println(count);
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            if (n == 0) break;

            int[] incomes = new int[n];
            int sum = 0;

            for (int i = 0; i < n; i++) {
                incomes[i] = sc.nextInt();
                sum += incomes[i];
            }

            double average = (double) sum / n;

            int count = 0;
            for (int i = 0; i < n; i++) {
                if (incomes[i] <= average) {
                    count++;
                }
            }

            System.out.println(count);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        while (true) {
            int n = scanner.nextInt();
            if (n == 0) break;

            int[] incomes = new int[n];
            int sum = 0;

            for (int i = 0; i < n; i++) {
                incomes[i] = scanner.nextInt();
                sum += incomes[i];
            }

            double average = (double) sum / n;
            int count = 0;

            for (int i = 0; i < n; i++) {
                if (incomes[i] <= average) {
                    count++;
                }
            }

            System.out.println(count);
        }

        scanner.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int N = sc.nextInt();
            if (N == 0) break;

            Set<String> gems = new HashSet<>();
            for (int i = 0; i < N; i++) {
                int x = sc.nextInt();
                int y = sc.nextInt();
                gems.add(x + "," + y);
            }

            int M = sc.nextInt();
            Set<String> visited = new HashSet<>();

            int x = 10, y = 10;
            visited.add(x + "," + y);

            for (int i = 0; i < M; i++) {
                String dir = sc.next();
                int dist = sc.nextInt();

                int dx = 0, dy = 0;
                switch (dir) {
                    case "N": dy = 1; break;
                    case "E": dx = 1; break;
                    case "S": dy = -1; break;
                    case "W": dx = -1; break;
                }

                for (int j = 0; j < dist; j++) {
                    x += dx;
                    y += dy;
                    visited.add(x + "," + y);
                }
            }

            boolean allCollected = true;
            for (String gem : gems) {
                if (!visited.contains(gem)) {
                    allCollected = false;
                    break;
                }
            }

            System.out.println(allCollected ? "Yes" : "No");
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int N = sc.nextInt();
            if (N == 0) break;

            Set<String> gems = new HashSet<>();
            for (int i = 0; i < N; i++) {
                int x = sc.nextInt();
                int y = sc.nextInt();
                gems.add(x + "," + y);
            }

            int M = sc.nextInt();
            Set<String> visited = new HashSet<>();

            int x = 10, y = 10;
            visited.add(x + "," + y);

            for (int i = 0; i < M; i++) {
                String dir = sc.next();
                int dist = sc.nextInt();

                int dx = 0, dy = 0;
                switch (dir) {
                    case "N": dy = 1; break;
                    case "E": dx = 1; break;
                    case "S": dy = -1; break;
                    case "W": dx = -1; break;
                }

                for (int j = 0; j < dist; j++) {
                    x += dx;
                    y += dy;
                    visited.add(x + "," + y);
                }
            }

            boolean allCollected = true;
            for (String gem : gems) {
                if (!visited.contains(gem)) {
                    allCollected = false;
                    break;
                }
            }

            System.out.println(allCollected ? "Yes" : "No");
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int testCases = sc.nextInt();
        sc.nextLine();

        String[] keypad = {
            "",
            ".,!? ",
            "abc",
            "def",
            "ghi",
            "jkl",
            "mno",
            "pqrs",
            "tuv",
            "wxyz"
        };

        for (int t = 0; t < testCases; t++) {
            String input = sc.nextLine();
            StringBuilder result = new StringBuilder();

            int i = 0;
            while (i < input.length()) {
                char digit = input.charAt(i);

                if (digit == '0') {
                    i++;
                    continue;
                }

                int count = 0;
                int start = i;
                while (i < input.length() && input.charAt(i) == digit) {
                    count++;
                    i++;
                }

                int digitNum = digit - '0';
                String chars = keypad[digitNum];
                if (chars.length() > 0) {
                    int charIndex = (count - 1) % chars.length();
                    result.append(chars.charAt(charIndex));
                }
            }

            System.out.println(result.toString());
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int testCases = sc.nextInt();
        sc.nextLine();

        String[] keypad = {
            "",
            " .,!?",
            "abc",
            "def",
            "ghi",
            "jkl",
            "mno",
            "pqrs",
            "tuv",
            "wxyz"
        };

        for (int t = 0; t < testCases; t++) {
            String input = sc.nextLine();
            StringBuilder result = new StringBuilder();

            int i = 0;
            while (i < input.length()) {
                char digit = input.charAt(i);

                if (digit == '0') {
                    i++;
                    continue;
                }

                int count = 0;
                int start = i;
                while (i < input.length() && input.charAt(i) == digit) {
                    count++;
                    i++;
                }

                int keyNum = digit - '0';
                String chars = keypad[keyNum];
                if (chars.length() > 0) {
                    int charIndex = (count - 1) % chars.length();
                    result.append(chars.charAt(charIndex));
                }
            }

            System.out.println(result.toString());
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int e = sc.nextInt();
            if (e == 0) break;

            int minSum = Integer.MAX_VALUE;

            for (int z = 0; z * z * z <= e; z++) {
                int remaining = e - z * z * z;

                for (int y = 0; y * y <= remaining; y++) {
                    int x = remaining - y * y;

                    if (x >= 0) {
                        int sum = x + y + z;
                        minSum = Math.min(minSum, sum);
                    }
                }
            }

            System.out.println(minSum);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int e = sc.nextInt();
            if (e == 0) break;

            int minSum = Integer.MAX_VALUE;

            for (int z = 0; z * z * z <= e; z++) {
                int remaining = e - z * z * z;

                for (int y = 0; y * y <= remaining; y++) {
                    int x = remaining - y * y;

                    if (x >= 0) {
                        int sum = x + y + z;
                        minSum = Math.min(minSum, sum);
                    }
                }
            }

            System.out.println(minSum);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int e = sc.nextInt();
            if (e == 0) break;

            int minSum = Integer.MAX_VALUE;

            for (int z = 0; z * z * z <= e; z++) {
                int remaining = e - z * z * z;

                for (int y = 0; y * y <= remaining; y++) {
                    int x = remaining - y * y;

                    if (x >= 0) {
                        int sum = x + y + z;
                        minSum = Math.min(minSum, sum);
                    }
                }
            }

            System.out.println(minSum);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class SpaceCoconutCrab {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int e = sc.nextInt();
            if (e == 0) break;

            int minSum = Integer.MAX_VALUE;

            for (int z = 0; z * z * z <= e; z++) {
                int remaining = e - z * z * z;

                for (int y = 0; y * y <= remaining; y++) {
                    int x = remaining - y * y;

                    if (x >= 0) {
                        int sum = x + y + z;
                        minSum = Math.min(minSum, sum);
                    }
                }
            }

            System.out.println(minSum);
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int N = sc.nextInt();
            int M = sc.nextInt();

            if (N == 0 && M == 0) break;

            int[] h = new int[N];
            int[] w = new int[M];

            for (int i = 0; i < N; i++) {
                h[i] = sc.nextInt();
            }

            for (int i = 0; i < M; i++) {
                w[i] = sc.nextInt();
            }

            int[] hCum = new int[N + 1];
            int[] wCum = new int[M + 1];

            for (int i = 0; i < N; i++) {
                hCum[i + 1] = hCum[i] + h[i];
            }

            for (int i = 0; i < M; i++) {
                wCum[i + 1] = wCum[i] + w[i];
            }

            int count = 0;

            for (int i = 0; i <= N; i++) {
                for (int j = 0; j <= M; j++) {
                    for (int i2 = i + 1; i2 <= N; i2++) {
                        for (int j2 = j + 1; j2 <= M; j2++) {
                            int height = hCum[i2] - hCum[i];
                            int width = wCum[j2] - wCum[j];

                            if (height == width) {
                                count++;
                            }
                        }
                    }
                }
            }

            System.out.println(count);
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int N = sc.nextInt();
            int M = sc.nextInt();

            if (N == 0 && M == 0) break;

            int[] h = new int[N];
            int[] w = new int[M];

            for (int i = 0; i < N; i++) {
                h[i] = sc.nextInt();
            }

            for (int i = 0; i < M; i++) {
                w[i] = sc.nextInt();
            }

            int[] hCum = new int[N + 1];
            int[] wCum = new int[M + 1];

            for (int i = 0; i < N; i++) {
                hCum[i + 1] = hCum[i] + h[i];
            }

            for (int i = 0; i < M; i++) {
                wCum[i + 1] = wCum[i] + w[i];
            }

            int count = 0;

            for (int i = 0; i <= N; i++) {
                for (int j = 0; j <= M; j++) {
                    for (int k = i + 1; k <= N; k++) {
                        for (int l = j + 1; l <= M; l++) {
                            int height = hCum[k] - hCum[i];
                            int width = wCum[l] - wCum[j];

                            if (height == width) {
                                count++;
                            }
                        }
                    }
                }
            }

            System.out.println(count);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int N = sc.nextInt();
            int M = sc.nextInt();
            int P = sc.nextInt();

            if (N == 0 && M == 0 && P == 0) break;

            int[] tickets = new int[N];
            int totalTickets = 0;

            for (int i = 0; i < N; i++) {
                tickets[i] = sc.nextInt();
                totalTickets += tickets[i];
            }

            int winningTickets = tickets[M - 1];

            if (winningTickets == 0) {
                System.out.println(0);
            } else {
                int totalPool = totalTickets * 100;
                int afterDeduction = totalPool * (100 - P) / 100;
                int payoutPerTicket = afterDeduction / winningTickets;
                System.out.println(payoutPerTicket);
            }
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int N = sc.nextInt();
            int M = sc.nextInt();
            int P = sc.nextInt();

            if (N == 0 && M == 0 && P == 0) break;

            int[] votes = new int[N];
            int totalVotes = 0;

            for (int i = 0; i < N; i++) {
                votes[i] = sc.nextInt();
                totalVotes += votes[i];
            }

            int winnerVotes = votes[M - 1];

            if (winnerVotes == 0) {
                System.out.println(0);
            } else {
                int totalPool = totalVotes * 100;
                int afterDeduction = totalPool * (100 - P) / 100;
                int payoutPerTicket = afterDeduction / winnerVotes;
                System.out.println(payoutPerTicket);
            }
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int t = sc.nextInt();

        for (int i = 0; i < t; i++) {
            int n = sc.nextInt();
            int[] heights = new int[n];

            for (int j = 0; j < n; j++) {
                heights[j] = sc.nextInt();
            }

            int maxUp = 0;
            int maxDown = 0;

            for (int j = 1; j < n; j++) {
                int diff = heights[j] - heights[j-1];
                if (diff > 0) {
                    maxUp = Math.max(maxUp, diff);
                } else if (diff < 0) {
                    maxDown = Math.max(maxDown, -diff);
                }
            }

            System.out.println(maxUp + " " + maxDown);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int t = sc.nextInt();

        for (int i = 0; i < t; i++) {
            int n = sc.nextInt();
            int[] heights = new int[n];

            for (int j = 0; j < n; j++) {
                heights[j] = sc.nextInt();
            }

            int maxUp = 0;
            int maxDown = 0;

            for (int j = 1; j < n; j++) {
                int diff = heights[j] - heights[j-1];
                if (diff > 0) {
                    maxUp = Math.max(maxUp, diff);
                } else if (diff < 0) {
                    maxDown = Math.max(maxDown, -diff);
                }
            }

            System.out.println(maxUp + " " + maxDown);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int t = sc.nextInt();

        for (int i = 0; i < t; i++) {
            int n = sc.nextInt();
            int[] heights = new int[n];

            for (int j = 0; j < n; j++) {
                heights[j] = sc.nextInt();
            }

            int maxUp = 0;
            int maxDown = 0;

            for (int j = 1; j < n; j++) {
                int diff = heights[j] - heights[j-1];
                if (diff > 0) {
                    maxUp = Math.max(maxUp, diff);
                } else if (diff < 0) {
                    maxDown = Math.max(maxDown, -diff);
                }
            }

            System.out.println(maxUp + " " + maxDown);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int t = sc.nextInt();

        while (t-- > 0) {
            int n = sc.nextInt();
            int[] heights = new int[n];

            for (int i = 0; i < n; i++) {
                heights[i] = sc.nextInt();
            }

            int maxUp = 0;
            int maxDown = 0;

            for (int i = 1; i < n; i++) {
                int diff = heights[i] - heights[i-1];
                if (diff > 0) {
                    maxUp = Math.max(maxUp, diff);
                } else if (diff < 0) {
                    maxDown = Math.max(maxDown, -diff);
                }
            }

            System.out.println(maxUp + " " + maxDown);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int t = sc.nextInt();

        while (t-- > 0) {
            int n = sc.nextInt();
            int[] heights = new int[n];

            for (int i = 0; i < n; i++) {
                heights[i] = sc.nextInt();
            }

            int maxUp = 0;
            int maxDown = 0;

            for (int i = 1; i < n; i++) {
                int diff = heights[i] - heights[i-1];
                if (diff > 0) {
                    maxUp = Math.max(maxUp, diff);
                } else if (diff < 0) {
                    maxDown = Math.max(maxDown, -diff);
                }
            }

            System.out.println(maxUp + " " + maxDown);
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int N = sc.nextInt();
            int M = sc.nextInt();

            if (N == 0 && M == 0) break;

            List<Packet> packets = new ArrayList<>();
            for (int i = 0; i < M; i++) {
                int t = sc.nextInt();
                int s = sc.nextInt();
                int d = sc.nextInt();
                packets.add(new Packet(t, s, d));
            }

            packets.sort((a, b) -> Integer.compare(a.time, b.time));

            Set<Integer> infected = new HashSet<>();
            infected.add(1);

            for (Packet p : packets) {
                if (infected.contains(p.source)) {
                    infected.add(p.destination);
                }
            }

            System.out.println(infected.size());
        }

        sc.close();
    }

    static class Packet {
        int time, source, destination;

        Packet(int time, int source, int destination) {
            this.time = time;
            this.source = source;
            this.destination = destination;
        }
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int N = sc.nextInt();
            int M = sc.nextInt();

            if (N == 0 && M == 0) break;

            List<Packet> packets = new ArrayList<>();
            for (int i = 0; i < M; i++) {
                int t = sc.nextInt();
                int s = sc.nextInt();
                int d = sc.nextInt();
                packets.add(new Packet(t, s, d));
            }

            packets.sort((a, b) -> Integer.compare(a.time, b.time));

            Set<Integer> infected = new HashSet<>();
            infected.add(1);

            for (Packet p : packets) {
                if (infected.contains(p.source)) {
                    infected.add(p.destination);
                }
            }

            System.out.println(infected.size());
        }

        sc.close();
    }

    static class Packet {
        int time, source, destination;

        Packet(int time, int source, int destination) {
            this.time = time;
            this.source = source;
            this.destination = destination;
        }
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int N = sc.nextInt();
            int Q = sc.nextInt();

            if (N == 0 && Q == 0) break;

            int[] parent = new int[N + 1];
            parent[1] = 0;

            for (int i = 2; i <= N; i++) {
                parent[i] = sc.nextInt();
            }

            boolean[] marked = new boolean[N + 1];
            marked[1] = true;

            long sum = 0;

            for (int i = 0; i < Q; i++) {
                String op = sc.next();
                int v = sc.nextInt();

                if (op.equals("M")) {
                    marked[v] = true;
                } else {
                    int current = v;
                    while (current != 0 && !marked[current]) {
                        current = parent[current];
                    }
                    sum += current;
                }
            }

            System.out.println(sum);
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int N = sc.nextInt();
            int Q = sc.nextInt();

            if (N == 0 && Q == 0) break;

            int[] parent = new int[N + 1];
            parent[1] = 0;

            for (int i = 2; i <= N; i++) {
                parent[i] = sc.nextInt();
            }

            boolean[] marked = new boolean[N + 1];
            marked[1] = true;

            long sum = 0;

            for (int i = 0; i < Q; i++) {
                String op = sc.next();
                int v = sc.nextInt();

                if (op.equals("M")) {
                    marked[v] = true;
                } else {
                    int curr = v;
                    while (curr != 0 && !marked[curr]) {
                        curr = parent[curr];
                    }
                    sum += curr;
                }
            }

            System.out.println(sum);
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int N = sc.nextInt();
            int Q = sc.nextInt();

            if (N == 0 && Q == 0) break;

            int[] parent = new int[N + 1];
            parent[1] = 0;

            for (int i = 2; i <= N; i++) {
                parent[i] = sc.nextInt();
            }

            boolean[] marked = new boolean[N + 1];
            marked[1] = true;

            long sum = 0;

            for (int i = 0; i < Q; i++) {
                String op = sc.next();
                int v = sc.nextInt();

                if (op.equals("M")) {
                    marked[v] = true;
                } else {
                    int current = v;
                    while (!marked[current]) {
                        current = parent[current];
                    }
                    sum += current;
                }
            }

            System.out.println(sum);
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int N = sc.nextInt();
            int Q = sc.nextInt();

            if (N == 0 && Q == 0) break;

            int[] parent = new int[N + 1];
            parent[1] = 0;

            for (int i = 2; i <= N; i++) {
                parent[i] = sc.nextInt();
            }

            boolean[] marked = new boolean[N + 1];
            marked[1] = true;

            long sum = 0;

            for (int i = 0; i < Q; i++) {
                String op = sc.next();
                int v = sc.nextInt();

                if (op.equals("M")) {
                    marked[v] = true;
                } else {
                    int current = v;
                    while (!marked[current]) {
                        current = parent[current];
                    }
                    sum += current;
                }
            }

            System.out.println(sum);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int datasets = sc.nextInt();

        for (int d = 0; d < datasets; d++) {
            int X = sc.nextInt();
            int Y = sc.nextInt();
            int W = sc.nextInt();
            int H = sc.nextInt();

            int N = sc.nextInt();
            int count = 0;

            for (int i = 0; i < N; i++) {
                int x = sc.nextInt();
                int y = sc.nextInt();

                if (x >= X && x <= X + W && y >= Y && y <= Y + H) {
                    count++;
                }
            }

            System.out.println(count);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int dataSets = sc.nextInt();
        for (int i = 0; i < dataSets; i++) {
            int X = sc.nextInt();
            int Y = sc.nextInt();
            int W = sc.nextInt();
            int H = sc.nextInt();
            int N = sc.nextInt();
            int count = 0;
            for (int j = 0; j < N; j++) {
                int catX = sc.nextInt();
                int catY = sc.nextInt();
                if (catX >= X && catX <= X + W && catY >= Y && catY <= Y + H) {
                    count++;
                }
            }
            System.out.println(count);
        }
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int numDataSets = sc.nextInt();
        for (int i = 0; i < numDataSets; i++) {
            int X = sc.nextInt();
            int Y = sc.nextInt();
            int W = sc.nextInt();
            int H = sc.nextInt();
            int N = sc.nextInt();
            int catsInCampus = 0;
            for (int j = 0; j < N; j++) {
                int catX = sc.nextInt();
                int catY = sc.nextInt();
                if (catX >= X && catX <= X + W && catY >= Y && catY <= Y + H) {
                    catsInCampus++;
                }
            }
            System.out.println(catsInCampus);
        }
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int numDataSets = sc.nextInt();
        for (int i = 0; i < numDataSets; i++) {
            int X = sc.nextInt();
            int Y = sc.nextInt();
            int W = sc.nextInt();
            int H = sc.nextInt();
            int N = sc.nextInt();
            int count = 0;
            for (int j = 0; j < N; j++) {
                int x = sc.nextInt();
                int y = sc.nextInt();
                if (x >= X && x <= X + W && y >= Y && y <= Y + H) {
                    count++;
                }
            }
            System.out.println(count);
        }
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int datasets = sc.nextInt();

        for (int d = 0; d < datasets; d++) {
            int X = sc.nextInt();
            int Y = sc.nextInt();
            int W = sc.nextInt();
            int H = sc.nextInt();

            int N = sc.nextInt();
            int count = 0;

            for (int i = 0; i < N; i++) {
                int x = sc.nextInt();
                int y = sc.nextInt();

                if (x >= X && x <= X + W && y >= Y && y <= Y + H) {
                    count++;
                }
            }

            System.out.println(count);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int datasets = sc.nextInt();

        for (int d = 0; d < datasets; d++) {
            int X = sc.nextInt();
            int Y = sc.nextInt();
            int W = sc.nextInt();
            int H = sc.nextInt();

            int N = sc.nextInt();
            int count = 0;

            for (int i = 0; i < N; i++) {
                int x = sc.nextInt();
                int y = sc.nextInt();

                if (x >= X && x <= X + W && y >= Y && y <= Y + H) {
                    count++;
                }
            }

            System.out.println(count);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int datasets = sc.nextInt();

        while (datasets-- > 0) {
            int X = sc.nextInt();
            int Y = sc.nextInt();
            int W = sc.nextInt();
            int H = sc.nextInt();
            int N = sc.nextInt();

            int count = 0;
            for (int i = 0; i < N; i++) {
                int x = sc.nextInt();
                int y = sc.nextInt();

                if (x >= X && x <= X + W && y >= Y && y <= Y + H) {
                    count++;
                }
            }

            System.out.println(count);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int datasets = sc.nextInt();

        while (datasets-- > 0) {
            int X = sc.nextInt();
            int Y = sc.nextInt();
            int W = sc.nextInt();
            int H = sc.nextInt();
            int N = sc.nextInt();

            int count = 0;
            for (int i = 0; i < N; i++) {
                int x = sc.nextInt();
                int y = sc.nextInt();

                if (x >= X && x <= X + W && y >= Y && y <= Y + H) {
                    count++;
                }
            }

            System.out.println(count);
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int datasets = sc.nextInt();

        while (datasets-- > 0) {
            int gx = sc.nextInt();
            int gy = sc.nextInt();
            int p = sc.nextInt();

            Set<String> blocked = new HashSet<>();
            for (int i = 0; i < p; i++) {
                int x1 = sc.nextInt();
                int y1 = sc.nextInt();
                int x2 = sc.nextInt();
                int y2 = sc.nextInt();

                String edge = Math.min(x1, x2) + "," + Math.min(y1, y2) + "-" +
                             Math.max(x1, x2) + "," + Math.max(y1, y2);
                blocked.add(edge);
            }

            long[][] dp = new long[gx + 1][gy + 1];
            dp[0][0] = 1;

            for (int x = 0; x <= gx; x++) {
                for (int y = 0; y <= gy; y++) {
                    if (dp[x][y] == 0) continue;

                    if (x + 1 <= gx) {
                        String rightEdge = x + "," + y + "-" + (x + 1) + "," + y;
                        if (!blocked.contains(rightEdge)) {
                            dp[x + 1][y] += dp[x][y];
                        }
                    }

                    if (y + 1 <= gy) {
                        String upEdge = x + "," + y + "-" + x + "," + (y + 1);
                        if (!blocked.contains(upEdge)) {
                            dp[x][y + 1] += dp[x][y];
                        }
                    }
                }
            }

            if (dp[gx][gy] == 0) {
                System.out.println("Miserable Hokusai!");
            } else {
                System.out.println(dp[gx][gy]);
            }
        }
        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int datasets = sc.nextInt();

        while (datasets-- > 0) {
            int gx = sc.nextInt();
            int gy = sc.nextInt();
            int p = sc.nextInt();

            Set<String> blocked = new HashSet<>();
            for (int i = 0; i < p; i++) {
                int x1 = sc.nextInt();
                int y1 = sc.nextInt();
                int x2 = sc.nextInt();
                int y2 = sc.nextInt();

                String edge = Math.min(x1, x2) + "," + Math.min(y1, y2) + "-" +
                             Math.max(x1, x2) + "," + Math.max(y1, y2);
                blocked.add(edge);
            }

            long[][] dp = new long[gx + 1][gy + 1];
            dp[0][0] = 1;

            for (int x = 0; x <= gx; x++) {
                for (int y = 0; y <= gy; y++) {
                    if (dp[x][y] == 0) continue;

                    if (x + 1 <= gx) {
                        String edge = x + "," + y + "-" + (x + 1) + "," + y;
                        if (!blocked.contains(edge)) {
                            dp[x + 1][y] += dp[x][y];
                        }
                    }

                    if (y + 1 <= gy) {
                        String edge = x + "," + y + "-" + x + "," + (y + 1);
                        if (!blocked.contains(edge)) {
                            dp[x][y + 1] += dp[x][y];
                        }
                    }
                }
            }

            if (dp[gx][gy] == 0) {
                System.out.println("Miserable Hokusai!");
            } else {
                System.out.println(dp[gx][gy]);
            }
        }
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            if (n == 0) break;

            int count = 0;

            for (int start = 1; start < n; start++) {
                int sum = 0;
                int current = start;

                while (sum < n) {
                    sum += current;
                    current++;

                    if (sum == n && current - start >= 2) {
                        count++;
                        break;
                    }
                }
            }

            System.out.println(count);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int N = sc.nextInt();
            if (N == 0) break;

            int count = 0;

            for (int start = 1; start < N; start++) {
                int sum = 0;
                int current = start;

                while (sum < N) {
                    sum += current;
                    current++;

                    if (sum == N && current - start >= 2) {
                        count++;
                        break;
                    }
                }
            }

            System.out.println(count);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int N = sc.nextInt();
            if (N == 0) break;

            int count = 0;

            for (int start = 1; start < N; start++) {
                int sum = 0;
                int current = start;

                while (sum < N) {
                    sum += current;
                    current++;

                    if (sum == N && current - start >= 2) {
                        count++;
                        break;
                    }
                }
            }

            System.out.println(count);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int N = sc.nextInt();
            if (N == 0) break;

            int count = 0;

            for (int start = 1; start < N; start++) {
                int sum = 0;
                int current = start;

                while (sum < N) {
                    sum += current;
                    current++;

                    if (sum == N && current - start >= 2) {
                        count++;
                        break;
                    }
                }
            }

            System.out.println(count);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int N = sc.nextInt();
            if (N == 0) break;

            int count = 0;

            for (int start = 1; start < N; start++) {
                int sum = 0;
                int current = start;

                while (sum < N) {
                    sum += current;
                    current++;

                    if (sum == N && current - start >= 2) {
                        count++;
                        break;
                    }
                }
            }

            System.out.println(count);
        }

        sc.close();
    }
}

import java.util.*;
import java.io.*;

public class Main {
    static class Crop {
        String name;
        double efficiency;

        Crop(String name, double efficiency) {
            this.name = name;
            this.efficiency = efficiency;
        }
    }

    public static void main(String[] args) throws IOException {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int N = sc.nextInt();
            if (N == 0) break;

            List<Crop> crops = new ArrayList<>();

            for (int i = 0; i < N; i++) {
                String name = sc.next();
                int P = sc.nextInt();
                int A = sc.nextInt();
                int B = sc.nextInt();
                int C = sc.nextInt();
                int D = sc.nextInt();
                int E = sc.nextInt();
                int F = sc.nextInt();
                int S = sc.nextInt();
                int M = sc.nextInt();

                int totalTime = A + B + C + D + E + (M - 1) * E;

                int totalIncome = M * F * S - P;

                double efficiency = (double) totalIncome / totalTime;

                crops.add(new Crop(name, efficiency));
            }

            crops.sort((a, b) -> {
                if (Math.abs(a.efficiency - b.efficiency) < 1e-9) {
                    return a.name.compareTo(b.name);
                }
                return Double.compare(b.efficiency, a.efficiency);
            });

            for (Crop crop : crops) {
                System.out.println(crop.name);
            }
            System.out.println("#");
        }
    }
}

import java.util.*;
import java.io.*;

public class Main {
    static class Crop {
        String name;
        double efficiency;

        Crop(String name, double efficiency) {
            this.name = name;
            this.efficiency = efficiency;
        }
    }

    public static void main(String[] args) throws IOException {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int N = sc.nextInt();
            if (N == 0) break;

            List<Crop> crops = new ArrayList<>();

            for (int i = 0; i < N; i++) {
                String name = sc.next();
                int P = sc.nextInt();
                int A = sc.nextInt();
                int B = sc.nextInt();
                int C = sc.nextInt();
                int D = sc.nextInt();
                int E = sc.nextInt();
                int F = sc.nextInt();
                int S = sc.nextInt();
                int M = sc.nextInt();

                int totalTime = A + B + C + D + E + (M - 1) * E;

                int totalIncome = M * F * S - P;

                double efficiency = (double) totalIncome / totalTime;

                crops.add(new Crop(name, efficiency));
            }

            crops.sort((c1, c2) -> {
                if (Math.abs(c1.efficiency - c2.efficiency) < 1e-9) {
                    return c1.name.compareTo(c2.name);
                }
                return Double.compare(c2.efficiency, c1.efficiency);
            });

            for (Crop crop : crops) {
                System.out.println(crop.name);
            }
            System.out.println("#");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            if (n == 0) break;

            int maxTotal = Integer.MIN_VALUE;
            int minTotal = Integer.MAX_VALUE;

            for (int i = 0; i < n; i++) {
                int total = 0;
                for (int j = 0; j < 5; j++) {
                    total += sc.nextInt();
                }
                maxTotal = Math.max(maxTotal, total);
                minTotal = Math.min(minTotal, total);
            }

            System.out.println(maxTotal + " " + minTotal);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            if (n == 0) break;

            int maxTotal = Integer.MIN_VALUE;
            int minTotal = Integer.MAX_VALUE;

            for (int i = 0; i < n; i++) {
                int total = 0;
                for (int j = 0; j < 5; j++) {
                    total += sc.nextInt();
                }
                maxTotal = Math.max(maxTotal, total);
                minTotal = Math.min(minTotal, total);
            }

            System.out.println(maxTotal + " " + minTotal);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            if (n == 0) break;

            int maxTotal = Integer.MIN_VALUE;
            int minTotal = Integer.MAX_VALUE;

            for (int i = 0; i < n; i++) {
                int total = 0;
                for (int j = 0; j < 5; j++) {
                    total += sc.nextInt();
                }
                maxTotal = Math.max(maxTotal, total);
                minTotal = Math.min(minTotal, total);
            }

            System.out.println(maxTotal + " " + minTotal);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            if (n == 0) break;

            int maxTotal = Integer.MIN_VALUE;
            int minTotal = Integer.MAX_VALUE;

            for (int i = 0; i < n; i++) {
                int total = 0;
                for (int j = 0; j < 5; j++) {
                    total += sc.nextInt();
                }
                maxTotal = Math.max(maxTotal, total);
                minTotal = Math.min(minTotal, total);
            }

            System.out.println(maxTotal + " " + minTotal);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        while (true) {
            int n = scanner.nextInt();
            if (n == 0) break;

            int maxTotal = Integer.MIN_VALUE;
            int minTotal = Integer.MAX_VALUE;

            for (int i = 0; i < n; i++) {
                int total = 0;
                for (int j = 0; j < 5; j++) {
                    total += scanner.nextInt();
                }
                maxTotal = Math.max(maxTotal, total);
                minTotal = Math.min(minTotal, total);
            }

            System.out.println(maxTotal + " " + minTotal);
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int A = sc.nextInt();
            int B = sc.nextInt();

            if (A == 0 && B == 0) {
                break;
            }

            int change = B - A;

            int bills1000 = change / 1000;
            change %= 1000;

            int coins500 = change / 500;
            change %= 500;

            int coins100 = change / 100;

            System.out.println(coins100 + " " + coins500 + " " + bills1000);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int A = sc.nextInt();
            int B = sc.nextInt();

            if (A == 0 && B == 0) {
                break;
            }

            int change = B - A;

            int thousands = change / 1000;
            change %= 1000;

            int fiveHundreds = change / 500;
            change %= 500;

            int hundreds = change / 100;

            System.out.println(hundreds + " " + fiveHundreds + " " + thousands);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int A = sc.nextInt();
            int B = sc.nextInt();

            if (A == 0 && B == 0) {
                break;
            }

            int change = B - A;

            int thousands = change / 1000;
            change %= 1000;

            int fiveHundreds = change / 500;
            change %= 500;

            int hundreds = change / 100;

            System.out.println(hundreds + " " + fiveHundreds + " " + thousands);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int a = sc.nextInt();
            int b = sc.nextInt();

            if (a == 0 && b == 0) {
                break;
            }

            int change = b - a;

            int thousands = change / 1000;
            change %= 1000;

            int fiveHundreds = change / 500;
            change %= 500;

            int hundreds = change / 100;

            System.out.println(hundreds + " " + fiveHundreds + " " + thousands);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int A = sc.nextInt();
            int B = sc.nextInt();

            if (A == 0 && B == 0) break;

            int change = B - A;

            int thousands = change / 1000;
            change %= 1000;

            int fiveHundreds = change / 500;
            change %= 500;

            int hundreds = change / 100;

            System.out.println(hundreds + " " + fiveHundreds + " " + thousands);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int A = sc.nextInt();
            int B = sc.nextInt();

            if (A == 0 && B == 0) break;

            int change = B - A;

            int bills1000 = change / 1000;
            change %= 1000;

            int coins500 = change / 500;
            change %= 500;

            int coins100 = change / 100;

            System.out.println(coins100 + " " + coins500 + " " + bills1000);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int A = sc.nextInt();
            int B = sc.nextInt();

            if (A == 0 && B == 0) break;

            int change = B - A;

            int thousands = change / 1000;
            change %= 1000;

            int fiveHundreds = change / 500;
            change %= 500;

            int hundreds = change / 100;

            System.out.println(hundreds + " " + fiveHundreds + " " + thousands);
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    static class Point {
        int x, y;
        Point(int x, int y) {
            this.x = x;
            this.y = y;
        }

        @Override
        public boolean equals(Object obj) {
            if (obj instanceof Point) {
                Point p = (Point) obj;
                return x == p.x && y == p.y;
            }
            return false;
        }

        @Override
        public int hashCode() {
            return x * 1000 + y;
        }
    }

    static int[][] directions = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}, {1, -1}, {-1, 1}};

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int t = sc.nextInt();
            int n = sc.nextInt();

            if (t == 0 && n == 0) break;

            Set<Point> obstacles = new HashSet<>();
            for (int i = 0; i < n; i++) {
                int x = sc.nextInt();
                int y = sc.nextInt();
                obstacles.add(new Point(x, y));
            }

            int startX = sc.nextInt();
            int startY = sc.nextInt();
            Point start = new Point(startX, startY);

            Set<Point> reachable = new HashSet<>();
            Queue<Point> queue = new LinkedList<>();
            Map<Point, Integer> distance = new HashMap<>();

            queue.offer(start);
            distance.put(start, 0);
            reachable.add(start);

            while (!queue.isEmpty()) {
                Point current = queue.poll();
                int currentDist = distance.get(current);

                if (currentDist >= t) continue;

                for (int[] dir : directions) {
                    int newX = current.x + dir[0];
                    int newY = current.y + dir[1];
                    Point next = new Point(newX, newY);

                    if (obstacles.contains(next)) continue;
                    if (distance.containsKey(next)) continue;

                    distance.put(next, currentDist + 1);
                    reachable.add(next);
                    queue.offer(next);
                }
            }

            System.out.println(reachable.size());
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    static class Point {
        int x, y;
        Point(int x, int y) {
            this.x = x;
            this.y = y;
        }

        @Override
        public boolean equals(Object obj) {
            if (obj instanceof Point) {
                Point p = (Point) obj;
                return x == p.x && y == p.y;
            }
            return false;
        }

        @Override
        public int hashCode() {
            return x * 1000 + y;
        }
    }

    static int[][] directions = {
        {1, 0}, {-1, 0}, {0, 1}, {0, -1}, {1, -1}, {-1, 1}
    };

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int t = sc.nextInt();
            int n = sc.nextInt();

            if (t == 0 && n == 0) break;

            Set<Point> obstacles = new HashSet<>();
            for (int i = 0; i < n; i++) {
                int x = sc.nextInt();
                int y = sc.nextInt();
                obstacles.add(new Point(x, y));
            }

            int startX = sc.nextInt();
            int startY = sc.nextInt();
            Point start = new Point(startX, startY);

            Set<Point> reachable = new HashSet<>();
            Queue<Point> queue = new LinkedList<>();
            Map<Point, Integer> distance = new HashMap<>();

            queue.offer(start);
            distance.put(start, 0);
            reachable.add(start);

            while (!queue.isEmpty()) {
                Point current = queue.poll();
                int currentDist = distance.get(current);

                if (currentDist >= t) continue;

                for (int[] dir : directions) {
                    int newX = current.x + dir[0];
                    int newY = current.y + dir[1];
                    Point next = new Point(newX, newY);

                    if (obstacles.contains(next)) continue;
                    if (distance.containsKey(next)) continue;

                    distance.put(next, currentDist + 1);
                    reachable.add(next);
                    queue.offer(next);
                }
            }

            System.out.println(reachable.size());
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int M = sc.nextInt();
        int N = sc.nextInt();

        int maxSolved = 0;

        for (int i = 0; i < M; i++) {
            int solved = 0;
            for (int j = 0; j < N; j++) {
                solved += sc.nextInt();
            }
            maxSolved = Math.max(maxSolved, solved);
        }

        System.out.println(maxSolved);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int M = sc.nextInt();
        int N = sc.nextInt();

        int maxSolved = 0;

        for (int i = 0; i < M; i++) {
            int solved = 0;
            for (int j = 0; j < N; j++) {
                solved += sc.nextInt();
            }
            maxSolved = Math.max(maxSolved, solved);
        }

        System.out.println(maxSolved);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int M = sc.nextInt();
        int N = sc.nextInt();

        int maxSolved = 0;

        for (int i = 0; i < M; i++) {
            int solved = 0;
            for (int j = 0; j < N; j++) {
                solved += sc.nextInt();
            }
            maxSolved = Math.max(maxSolved, solved);
        }

        System.out.println(maxSolved);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int M = sc.nextInt();
        int N = sc.nextInt();

        int maxSolved = 0;

        for (int i = 0; i < M; i++) {
            int solved = 0;
            for (int j = 0; j < N; j++) {
                solved += sc.nextInt();
            }
            maxSolved = Math.max(maxSolved, solved);
        }

        System.out.println(maxSolved);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int M = sc.nextInt();
        int N = sc.nextInt();

        int maxSolved = 0;

        for (int i = 0; i < M; i++) {
            int solved = 0;
            for (int j = 0; j < N; j++) {
                solved += sc.nextInt();
            }
            maxSolved = Math.max(maxSolved, solved);
        }

        System.out.println(maxSolved);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String s = sc.nextLine();

        int countK = 0, countU = 0, countP = 0, countC = 0;

        for (char c : s.toCharArray()) {
            if (c == 'K' || c == 'k') countK++;
            else if (c == 'U' || c == 'u') countU++;
            else if (c == 'P' || c == 'p') countP++;
            else if (c == 'C' || c == 'c') countC++;
        }

        int result = Math.min(Math.min(countK, countU), Math.min(countP, countC));
        System.out.println(result);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String s = sc.next();
        int k = 0, u = 0, p = 0, c = 0;
        for (char ch : s.toCharArray()) {
            if (ch == 'K' || ch == 'k') k++;
            else if (ch == 'U' || ch == 'u') u++;
            else if (ch == 'P' || ch == 'p') p++;
            else if (ch == 'C' || ch == 'c') c++;
        }
        int ans = Math.min(Math.min(k, u), Math.min(p, c));
        System.out.println(ans);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int H = sc.nextInt();
        int W = sc.nextInt();

        int[][] grid = new int[H][W];
        for (int i = 0; i < H; i++) {
            String line = sc.next();
            for (int j = 0; j < W; j++) {
                grid[i][j] = line.charAt(j) - '0';
            }
        }

        int[][] dp = new int[H][W];

        dp[0][0] = grid[0][0];

        for (int j = 1; j < W; j++) {
            dp[0][j] = dp[0][j-1] + grid[0][j];
        }

        for (int i = 1; i < H; i++) {
            dp[i][0] = dp[i-1][0] + grid[i][0];
        }

        for (int i = 1; i < H; i++) {
            for (int j = 1; j < W; j++) {
                dp[i][j] = Math.min(dp[i-1][j], dp[i][j-1]) + grid[i][j];
            }
        }

        System.out.println(dp[H-1][W-1]);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int H = sc.nextInt();
        int W = sc.nextInt();

        int[][] grid = new int[H][W];
        for (int i = 0; i < H; i++) {
            String line = sc.next();
            for (int j = 0; j < W; j++) {
                grid[i][j] = line.charAt(j) - '0';
            }
        }

        int[][] dp = new int[H][W];

        dp[0][0] = grid[0][0];

        for (int j = 1; j < W; j++) {
            dp[0][j] = dp[0][j-1] + grid[0][j];
        }

        for (int i = 1; i < H; i++) {
            dp[i][0] = dp[i-1][0] + grid[i][0];
        }

        for (int i = 1; i < H; i++) {
            for (int j = 1; j < W; j++) {
                dp[i][j] = Math.min(dp[i-1][j], dp[i][j-1]) + grid[i][j];
            }
        }

        System.out.println(dp[H-1][W-1]);
    }
}

public class Main {
    public static void main(String[] args) {
        java.util.Scanner sc = new java.util.Scanner(System.in);
        long n = sc.nextLong();

        int weighings = 0;
        long remaining = n;

        while (remaining > 1) {
            remaining = (remaining + 2) / 3;
            weighings++;
        }

        System.out.println(weighings);
    }
}

public class Main {
    public static void main(String[] args) {
        java.util.Scanner sc = new java.util.Scanner(System.in);
        long N = sc.nextLong();

        int weighings = 0;
        long remaining = N;

        while (remaining > 1) {
            remaining = (remaining + 2) / 3;
            weighings++;
        }

        System.out.println(weighings);
    }
}

public class Main {
    public static void main(String[] args) {
        java.util.Scanner sc = new java.util.Scanner(System.in);
        long n = sc.nextLong();

        int weighings = 0;
        long temp = n;

        while (temp > 1) {
            temp = (temp + 2) / 3;
            weighings++;
        }

        System.out.println(weighings);
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int N = sc.nextInt();
            if (N == 0) break;

            List<Set<Integer>> knows = new ArrayList<>();
            for (int i = 0; i <= N; i++) {
                knows.add(new HashSet<>());
            }

            for (int i = 1; i <= N; i++) {
                int M = sc.nextInt();
                for (int j = 0; j < M; j++) {
                    int person = sc.nextInt();
                    knows.get(i).add(person);
                }
            }

            int K = sc.nextInt();
            Set<Integer> leaked = new HashSet<>();
            for (int i = 0; i < K; i++) {
                leaked.add(sc.nextInt());
            }

            List<Integer> suspects = new ArrayList<>();

            for (int i = 1; i <= N; i++) {
                boolean canLeak = true;
                for (int leakedPerson : leaked) {
                    if (!knows.get(i).contains(leakedPerson)) {
                        canLeak = false;
                        break;
                    }
                }
                if (canLeak) {
                    suspects.add(i);
                }
            }

            if (suspects.size() == 1) {
                System.out.println(suspects.get(0));
            } else {
                System.out.println(-1);
            }
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int N = sc.nextInt();
            if (N == 0) break;

            List<Set<Integer>> knows = new ArrayList<>();
            for (int i = 0; i <= N; i++) {
                knows.add(new HashSet<>());
            }

            for (int i = 1; i <= N; i++) {
                int M = sc.nextInt();
                for (int j = 0; j < M; j++) {
                    int person = sc.nextInt();
                    knows.get(i).add(person);
                }
            }

            int K = sc.nextInt();
            Set<Integer> leaked = new HashSet<>();
            for (int i = 0; i < K; i++) {
                leaked.add(sc.nextInt());
            }

            List<Integer> suspects = new ArrayList<>();

            for (int i = 1; i <= N; i++) {
                boolean canLeak = true;
                for (int leakedPerson : leaked) {
                    if (!knows.get(i).contains(leakedPerson)) {
                        canLeak = false;
                        break;
                    }
                }
                if (canLeak) {
                    suspects.add(i);
                }
            }

            if (suspects.size() == 1) {
                System.out.println(suspects.get(0));
            } else {
                System.out.println(-1);
            }
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int N = sc.nextInt();
            if (N == 0) break;

            Set<Integer>[] knows = new Set[N + 1];
            for (int i = 1; i <= N; i++) {
                knows[i] = new HashSet<>();
            }

            for (int i = 1; i <= N; i++) {
                int M = sc.nextInt();
                for (int j = 0; j < M; j++) {
                    int person = sc.nextInt();
                    knows[i].add(person);
                }
            }

            int K = sc.nextInt();
            Set<Integer> leaked = new HashSet<>();
            for (int i = 0; i < K; i++) {
                leaked.add(sc.nextInt());
            }

            List<Integer> candidates = new ArrayList<>();
            for (int i = 1; i <= N; i++) {
                boolean canLeak = true;
                for (int leakedPerson : leaked) {
                    if (!knows[i].contains(leakedPerson)) {
                        canLeak = false;
                        break;
                    }
                }
                if (canLeak) {
                    candidates.add(i);
                }
            }

            if (candidates.size() == 1) {
                System.out.println(candidates.get(0));
            } else {
                System.out.println(-1);
            }
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int N = sc.nextInt();
            if (N == 0) break;

            Set<Integer>[] knows = new Set[N + 1];
            for (int i = 1; i <= N; i++) {
                knows[i] = new HashSet<>();
            }

            for (int i = 1; i <= N; i++) {
                int M = sc.nextInt();
                for (int j = 0; j < M; j++) {
                    int person = sc.nextInt();
                    knows[i].add(person);
                }
            }

            int K = sc.nextInt();
            Set<Integer> leaked = new HashSet<>();
            for (int i = 0; i < K; i++) {
                leaked.add(sc.nextInt());
            }

            List<Integer> suspects = new ArrayList<>();

            for (int i = 1; i <= N; i++) {
                boolean canLeak = true;
                for (int leakedPerson : leaked) {
                    if (!knows[i].contains(leakedPerson)) {
                        canLeak = false;
                        break;
                    }
                }
                if (canLeak) {
                    suspects.add(i);
                }
            }

            if (suspects.size() == 1) {
                System.out.println(suspects.get(0));
            } else {
                System.out.println(-1);
            }
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int N = sc.nextInt();
            if (N == 0) break;

            Set<Integer>[] knows = new Set[N + 1];
            for (int i = 1; i <= N; i++) {
                knows[i] = new HashSet<>();
            }

            for (int i = 1; i <= N; i++) {
                int M = sc.nextInt();
                for (int j = 0; j < M; j++) {
                    int person = sc.nextInt();
                    knows[i].add(person);
                }
            }

            int K = sc.nextInt();
            Set<Integer> leaked = new HashSet<>();
            for (int i = 0; i < K; i++) {
                leaked.add(sc.nextInt());
            }

            List<Integer> culprits = new ArrayList<>();

            for (int i = 1; i <= N; i++) {
                boolean canLeak = true;
                for (int leakedPerson : leaked) {
                    if (!knows[i].contains(leakedPerson)) {
                        canLeak = false;
                        break;
                    }
                }
                if (canLeak) {
                    culprits.add(i);
                }
            }

            if (culprits.size() == 1) {
                System.out.println(culprits.get(0));
            } else {
                System.out.println(-1);
            }
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int T = sc.nextInt();
        int E = sc.nextInt();

        int[] x = new int[N];
        for (int i = 0; i < N; i++) {
            x[i] = sc.nextInt();
        }

        int minTime = T - E;
        int maxTime = T + E;

        for (int i = 0; i < N; i++) {
            int k = minTime / x[i];
            if (k * x[i] < minTime) {
                k++;
            }

            if (k * x[i] <= maxTime) {
                System.out.println(i + 1);
                return;
            }
        }

        System.out.println(-1);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int T = sc.nextInt();
        int E = sc.nextInt();

        int[] x = new int[N];
        for (int i = 0; i < N; i++) {
            x[i] = sc.nextInt();
        }

        int minTime = T - E;
        int maxTime = T + E;

        for (int i = 0; i < N; i++) {
            int k = minTime / x[i];
            if (k * x[i] < minTime) {
                k++;
            }

            if (k * x[i] <= maxTime) {
                System.out.println(i + 1);
                return;
            }
        }

        System.out.println(-1);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int T = sc.nextInt();
        int E = sc.nextInt();

        int[] x = new int[N];
        for (int i = 0; i < N; i++) {
            x[i] = sc.nextInt();
        }

        int minTime = T - E;
        int maxTime = T + E;

        for (int i = 0; i < N; i++) {
            int k = minTime / x[i];
            if (k * x[i] < minTime) {
                k++;
            }

            if (k * x[i] <= maxTime) {
                System.out.println(i + 1);
                return;
            }
        }

        System.out.println(-1);
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int Q = sc.nextInt();

        for (int i = 0; i < Q; i++) {
            long N = sc.nextLong();
            System.out.println(solve(N));
        }
    }

    static int solve(long n) {
        Set<Long> visited = new HashSet<>();
        int steps = 0;

        while (n >= 10) {
            if (visited.contains(n)) {
                return -1;
            }
            visited.add(n);

            String s = String.valueOf(n);
            long maxProduct = 0;

            for (int i = 1; i < s.length(); i++) {
                String left = s.substring(0, i);
                String right = s.substring(i);

                long leftNum = Long.parseLong(left);
                long rightNum = Long.parseLong(right);

                long product = leftNum * rightNum;
                maxProduct = Math.max(maxProduct, product);
            }

            n = maxProduct;
            steps++;
        }

        return steps;
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int Q = sc.nextInt();

        for (int i = 0; i < Q; i++) {
            long n = sc.nextLong();
            System.out.println(solve(n));
        }
    }

    static int solve(long n) {
        Set<Long> visited = new HashSet<>();
        int steps = 0;

        while (n >= 10) {
            if (visited.contains(n)) {
                return -1;
            }
            visited.add(n);

            String s = String.valueOf(n);
            long maxProduct = 0;

            for (int i = 1; i < s.length(); i++) {
                String left = s.substring(0, i);
                String right = s.substring(i);

                long leftNum = Long.parseLong(left);
                long rightNum = Long.parseLong(right);

                long product = leftNum * rightNum;
                maxProduct = Math.max(maxProduct, product);
            }

            n = maxProduct;
            steps++;
        }

        return steps;
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int Q = sc.nextInt();

        for (int i = 0; i < Q; i++) {
            long n = sc.nextLong();
            System.out.println(solve(n));
        }
    }

    static int solve(long n) {
        Set<Long> visited = new HashSet<>();
        int steps = 0;

        while (n >= 10) {
            if (visited.contains(n)) {
                return -1;
            }
            visited.add(n);

            String s = String.valueOf(n);
            long maxProduct = 0;

            for (int i = 1; i < s.length(); i++) {
                String left = s.substring(0, i);
                String right = s.substring(i);

                long leftNum = Long.parseLong(left);
                long rightNum = Long.parseLong(right);
                long product = leftNum * rightNum;

                maxProduct = Math.max(maxProduct, product);
            }

            n = maxProduct;
            steps++;
        }

        return steps;
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        int m = sc.nextInt();

        int[] treasureX = new int[n];
        int[] treasureY = new int[n];

        for (int i = 0; i < n; i++) {
            treasureX[i] = sc.nextInt();
            treasureY[i] = sc.nextInt();
        }

        for (int i = 0; i < m; i++) {
            int x1 = sc.nextInt();
            int y1 = sc.nextInt();
            int x2 = sc.nextInt();
            int y2 = sc.nextInt();

            int count = 0;

            for (int j = 0; j < n; j++) {
                if (treasureX[j] >= x1 && treasureX[j] <= x2 &&
                    treasureY[j] >= y1 && treasureY[j] <= y2) {
                    count++;
                }
            }

            System.out.println(count);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        int m = sc.nextInt();

        int[] treasureX = new int[n];
        int[] treasureY = new int[n];
        for (int i = 0; i < n; i++) {
            treasureX[i] = sc.nextInt();
            treasureY[i] = sc.nextInt();
        }

        for (int i = 0; i < m; i++) {
            int x1 = sc.nextInt();
            int y1 = sc.nextInt();
            int x2 = sc.nextInt();
            int y2 = sc.nextInt();

            int count = 0;
            for (int j = 0; j < n; j++) {
                if (treasureX[j] >= x1 && treasureX[j] <= x2 &&
                    treasureY[j] >= y1 && treasureY[j] <= y2) {
                    count++;
                }
            }
            System.out.println(count);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        int m = sc.nextInt();

        int[] treasureX = new int[n];
        int[] treasureY = new int[n];

        for (int i = 0; i < n; i++) {
            treasureX[i] = sc.nextInt();
            treasureY[i] = sc.nextInt();
        }

        for (int i = 0; i < m; i++) {
            int x1 = sc.nextInt();
            int y1 = sc.nextInt();
            int x2 = sc.nextInt();
            int y2 = sc.nextInt();

            int count = 0;
            for (int j = 0; j < n; j++) {
                if (treasureX[j] >= x1 && treasureX[j] <= x2 &&
                    treasureY[j] >= y1 && treasureY[j] <= y2) {
                    count++;
                }
            }

            System.out.println(count);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        int m = sc.nextInt();

        int[] treasureX = new int[n];
        int[] treasureY = new int[n];
        for (int i = 0; i < n; i++) {
            treasureX[i] = sc.nextInt();
            treasureY[i] = sc.nextInt();
        }

        for (int i = 0; i < m; i++) {
            int x1 = sc.nextInt();
            int y1 = sc.nextInt();
            int x2 = sc.nextInt();
            int y2 = sc.nextInt();

            int count = 0;
            for (int j = 0; j < n; j++) {
                if (treasureX[j] >= x1 && treasureX[j] <= x2 &&
                    treasureY[j] >= y1 && treasureY[j] <= y2) {
                    count++;
                }
            }
            System.out.println(count);
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int N = sc.nextInt();
        Set<String> registeredIds = new HashSet<>();

        for (int i = 0; i < N; i++) {
            registeredIds.add(sc.next());
        }

        int M = sc.nextInt();
        boolean isLocked = true;

        for (int i = 0; i < M; i++) {
            String id = sc.next();

            if (!registeredIds.contains(id)) {
                System.out.println("Unknown " + id);
            } else {
                if (isLocked) {
                    System.out.println("Opened by " + id);
                    isLocked = false;
                } else {
                    System.out.println("Closed by " + id);
                    isLocked = true;
                }
            }
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int N = sc.nextInt();
        Set<String> registeredIds = new HashSet<>();

        for (int i = 0; i < N; i++) {
            registeredIds.add(sc.next());
        }

        int M = sc.nextInt();
        boolean isLocked = true;

        for (int i = 0; i < M; i++) {
            String id = sc.next();

            if (!registeredIds.contains(id)) {
                System.out.println("Unknown " + id);
            } else {
                if (isLocked) {
                    System.out.println("Opened by " + id);
                    isLocked = false;
                } else {
                    System.out.println("Closed by " + id);
                    isLocked = true;
                }
            }
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int N = sc.nextInt();
        Set<String> registeredIds = new HashSet<>();

        for (int i = 0; i < N; i++) {
            registeredIds.add(sc.next());
        }

        int M = sc.nextInt();
        boolean isLocked = true;

        for (int i = 0; i < M; i++) {
            String id = sc.next();

            if (!registeredIds.contains(id)) {
                System.out.println("Unknown " + id);
            } else {
                if (isLocked) {
                    System.out.println("Opened by " + id);
                    isLocked = false;
                } else {
                    System.out.println("Closed by " + id);
                    isLocked = true;
                }
            }
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int N = sc.nextInt();
        Set<String> registeredIds = new HashSet<>();

        for (int i = 0; i < N; i++) {
            registeredIds.add(sc.next());
        }

        int M = sc.nextInt();
        boolean isLocked = true;

        for (int i = 0; i < M; i++) {
            String id = sc.next();

            if (registeredIds.contains(id)) {
                if (isLocked) {
                    System.out.println("Opened by " + id);
                    isLocked = false;
                } else {
                    System.out.println("Closed by " + id);
                    isLocked = true;
                }
            } else {
                System.out.println("Unknown " + id);
            }
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int N = sc.nextInt();
        Set<String> registeredIds = new HashSet<>();

        for (int i = 0; i < N; i++) {
            registeredIds.add(sc.next());
        }

        int M = sc.nextInt();
        boolean isLocked = true;

        for (int i = 0; i < M; i++) {
            String id = sc.next();

            if (registeredIds.contains(id)) {
                if (isLocked) {
                    System.out.println("Opened by " + id);
                    isLocked = false;
                } else {
                    System.out.println("Closed by " + id);
                    isLocked = true;
                }
            } else {
                System.out.println("Unknown " + id);
            }
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            if (n == 0) break;

            int[] keys = new int[n];
            for (int i = 0; i < n; i++) {
                keys[i] = sc.nextInt();
            }

            String s = sc.next();
            StringBuilder result = new StringBuilder();

            for (int i = 0; i < s.length(); i++) {
                char c = s.charAt(i);
                int key = keys[i % n];

                int pos;
                if (c >= 'a' && c <= 'z') {
                    pos = c - 'a';
                } else {
                    pos = c - 'A' + 26;
                }

                pos = (pos - key + 52) % 52;

                char decoded;
                if (pos < 26) {
                    decoded = (char)('a' + pos);
                } else {
                    decoded = (char)('A' + pos - 26);
                }

                result.append(decoded);
            }

            System.out.println(result.toString());
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            if (n == 0) break;

            int[] keys = new int[n];
            for (int i = 0; i < n; i++) {
                keys[i] = sc.nextInt();
            }

            String s = sc.next();
            StringBuilder result = new StringBuilder();

            for (int i = 0; i < s.length(); i++) {
                char c = s.charAt(i);
                int key = keys[i % n];

                int pos;
                if (c >= 'a' && c <= 'z') {
                    pos = c - 'a';
                } else {
                    pos = c - 'A' + 26;
                }

                pos = (pos - key + 52) % 52;

                char newChar;
                if (pos < 26) {
                    newChar = (char)('a' + pos);
                } else {
                    newChar = (char)('A' + pos - 26);
                }

                result.append(newChar);
            }

            System.out.println(result.toString());
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            if (n == 0) break;

            int[] keys = new int[n];
            for (int i = 0; i < n; i++) {
                keys[i] = sc.nextInt();
            }

            String s = sc.next();
            StringBuilder result = new StringBuilder();

            for (int i = 0; i < s.length(); i++) {
                char c = s.charAt(i);
                int key = keys[i % n];

                int pos;
                if (c >= 'a' && c <= 'z') {
                    pos = c - 'a';
                } else {
                    pos = c - 'A' + 26;
                }

                pos = (pos - key + 52) % 52;

                char newChar;
                if (pos < 26) {
                    newChar = (char)('a' + pos);
                } else {
                    newChar = (char)('A' + pos - 26);
                }

                result.append(newChar);
            }

            System.out.println(result.toString());
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int a = sc.nextInt();
        int b = sc.nextInt();
        int c = sc.nextInt();

        int cycle = a + b;

        int lcm = lcm(cycle, 60);

        for (int t = 0; t * 60 <= lcm; t++) {
            int arrivalTime = 60 * t + c;
            int timeInCycle = arrivalTime % cycle;

            if (timeInCycle <= a) {
                System.out.println(arrivalTime);
                return;
            }
        }

        System.out.println(-1);
    }

    static int gcd(int a, int b) {
        return b == 0 ? a : gcd(b, a % b);
    }

    static int lcm(int a, int b) {
        return a / gcd(a, b) * b;
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int a = sc.nextInt();
        int b = sc.nextInt();
        int c = sc.nextInt();

        int cycle = a + b;

        int lcm = lcm(cycle, 60);

        for (int t = 0; t * 60 <= lcm; t++) {
            int arrivalTime = 60 * t + c;
            int timeInCycle = arrivalTime % cycle;

            if (timeInCycle <= a) {
                System.out.println(arrivalTime);
                return;
            }
        }

        System.out.println(-1);
    }

    static int gcd(int a, int b) {
        return b == 0 ? a : gcd(b, a % b);
    }

    static int lcm(int a, int b) {
        return a / gcd(a, b) * b;
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int D = sc.nextInt();
            int E = sc.nextInt();

            if (D == 0 && E == 0) break;

            double minDiff = Double.MAX_VALUE;

            for (int x = 0; x <= D; x++) {
                int y = D - x;
                double railLength = Math.sqrt(x * x + y * y);
                double diff = Math.abs(railLength - E);
                minDiff = Math.min(minDiff, diff);
            }

            System.out.println(minDiff);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int D = sc.nextInt();
            int E = sc.nextInt();

            if (D == 0 && E == 0) break;

            double minDiff = Double.MAX_VALUE;

            for (int x = 0; x <= D; x++) {
                int y = D - x;
                double cost = Math.sqrt(x * x + y * y);
                double diff = Math.abs(cost - E);
                minDiff = Math.min(minDiff, diff);
            }

            System.out.println(minDiff);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int D = sc.nextInt();
            int E = sc.nextInt();

            if (D == 0 && E == 0) break;

            double minDiff = Double.MAX_VALUE;

            for (int x = 0; x <= D; x++) {
                int y = D - x;
                double distance = Math.sqrt(x * x + y * y);
                double diff = Math.abs(distance - E);

                if (diff < minDiff) {
                    minDiff = diff;
                }
            }

            System.out.printf("%.10f%n", minDiff);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        while (true) {
            int D = sc.nextInt();
            int E = sc.nextInt();
            if (D == 0 && E == 0) break;

            double minDiff = Double.MAX_VALUE;
            for (int x = 0; x <= D; x++) {
                int y = D - x;
                double cost = Math.sqrt(x * x + y * y);
                double diff = Math.abs(cost - E);
                if (diff < minDiff) {
                    minDiff = diff;
                }
            }
            System.out.printf("%.10f\n", minDiff);
        }
        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            if (n == 0) break;

            String[] airports = new String[n];
            for (int i = 0; i < n; i++) {
                airports[i] = sc.next();
            }

            String[] codes = new String[n];
            for (int i = 0; i < n; i++) {
                codes[i] = generateCodeString(airports[i]);
            }

            int result = findMinK(codes);
            System.out.println(result);
        }

        sc.close();
    }

    private static String generateCodeString(String name) {
        StringBuilder code = new StringBuilder();
        Set<Character> vowels = Set.of('a', 'i', 'u', 'e', 'o');

        code.append(name.charAt(0));

        for (int i = 0; i < name.length() - 1; i++) {
            if (vowels.contains(name.charAt(i))) {
                code.append(name.charAt(i + 1));
            }
        }

        return code.toString();
    }

    private static int findMinK(String[] codes) {
        int maxLength = 0;
        for (String code : codes) {
            maxLength = Math.max(maxLength, code.length());
        }

        for (int k = 1; k <= maxLength; k++) {
            Set<String> usedCodes = new HashSet<>();
            boolean valid = true;

            for (String code : codes) {
                String truncated = code.length() >= k ? code.substring(0, k) : code;
                if (usedCodes.contains(truncated)) {
                    valid = false;
                    break;
                }
                usedCodes.add(truncated);
            }

            if (valid) {
                return k;
            }
        }

        return -1;
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            if (n == 0) break;

            String[] airports = new String[n];
            for (int i = 0; i < n; i++) {
                airports[i] = sc.next();
            }

            String[] sequences = new String[n];
            for (int i = 0; i < n; i++) {
                sequences[i] = generateSequence(airports[i]);
            }

            int result = findMinK(sequences);
            System.out.println(result);
        }

        sc.close();
    }

    private static String generateSequence(String name) {
        StringBuilder sb = new StringBuilder();
        Set<Character> vowels = Set.of('a', 'i', 'u', 'e', 'o');

        sb.append(name.charAt(0));

        for (int i = 0; i < name.length() - 1; i++) {
            if (vowels.contains(name.charAt(i))) {
                sb.append(name.charAt(i + 1));
            }
        }

        return sb.toString();
    }

    private static int findMinK(String[] sequences) {
        int maxLen = 0;
        for (String seq : sequences) {
            maxLen = Math.max(maxLen, seq.length());
        }

        for (int k = 1; k <= maxLen; k++) {
            Set<String> codes = new HashSet<>();
            boolean valid = true;

            for (String seq : sequences) {
                String code = seq.length() >= k ? seq.substring(0, k) : seq;
                if (codes.contains(code)) {
                    valid = false;
                    break;
                }
                codes.add(code);
            }

            if (valid) {
                return k;
            }
        }

        return -1;
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int R0 = sc.nextInt();
            int W0 = sc.nextInt();
            int C = sc.nextInt();
            int R = sc.nextInt();

            if (R0 == 0 && W0 == 0 && C == 0 && R == 0) {
                break;
            }

            double minX = (double)(C * W0 - R0) / R;
            int X = Math.max(0, (int)Math.ceil(minX));

            System.out.println(X);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int R0 = sc.nextInt();
            int W0 = sc.nextInt();
            int C = sc.nextInt();
            int R = sc.nextInt();

            if (R0 == 0 && W0 == 0 && C == 0 && R == 0) {
                break;
            }

            double needed = (double)(C * W0 - R0) / R;
            int minX = Math.max(0, (int)Math.ceil(needed));

            System.out.println(minX);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int R0 = sc.nextInt();
            int W0 = sc.nextInt();
            int C = sc.nextInt();
            int R = sc.nextInt();

            if (R0 == 0 && W0 == 0 && C == 0 && R == 0) {
                break;
            }

            double minX = (double)(C * W0 - R0) / R;
            int X = Math.max(0, (int)Math.ceil(minX));

            System.out.println(X);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int R0 = sc.nextInt();
            int W0 = sc.nextInt();
            int C = sc.nextInt();
            int R = sc.nextInt();

            if (R0 == 0 && W0 == 0 && C == 0 && R == 0) {
                break;
            }

            double needed = (double)(C * W0 - R0) / R;
            int X = Math.max(0, (int)Math.ceil(needed));

            System.out.println(X);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        System.out.println(fibonacci(n));
        scanner.close();
    }

    public static long fibonacci(int n) {
        if (n == 0 || n == 1) {
            return 1;
        }

        long prev2 = 1;
        long prev1 = 1;
        long current = 0;

        for (int i = 2; i <= n; i++) {
            current = prev1 + prev2;
            prev2 = prev1;
            prev1 = current;
        }

        return current;
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        System.out.println(fibonacci(n));
        scanner.close();
    }

    public static long fibonacci(int n) {
        if (n == 0 || n == 1) {
            return 1;
        }

        long prev2 = 1;
        long prev1 = 1;
        long current = 0;

        for (int i = 2; i <= n; i++) {
            current = prev1 + prev2;
            prev2 = prev1;
            prev1 = current;
        }

        return current;
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        System.out.println(fibonacci(n));
        scanner.close();
    }

    public static long fibonacci(int n) {
        if (n == 0 || n == 1) {
            return 1;
        }

        long prev2 = 1;
        long prev1 = 1;
        long current = 0;

        for (int i = 2; i <= n; i++) {
            current = prev1 + prev2;
            prev2 = prev1;
            prev1 = current;
        }

        return current;
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        System.out.println(fibonacci(n));
        scanner.close();
    }

    public static long fibonacci(int n) {
        if (n == 0 || n == 1) {
            return 1;
        }

        long prev2 = 1;
        long prev1 = 1;
        long current = 0;

        for (int i = 2; i <= n; i++) {
            current = prev1 + prev2;
            prev2 = prev1;
            prev1 = current;
        }

        return current;
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        int[] p = new int[n + 1];
        for (int i = 0; i < n; i++) {
            int r = sc.nextInt();
            int c = sc.nextInt();
            if (i == 0) {
                p[0] = r;
            }
            p[i + 1] = c;
        }

        int[][] dp = new int[n][n];

        for (int l = 2; l <= n; l++) {
            for (int i = 0; i <= n - l; i++) {
                int j = i + l - 1;
                dp[i][j] = Integer.MAX_VALUE;
                for (int k = i; k < j; k++) {
                    int cost = dp[i][k] + dp[k + 1][j] + p[i] * p[k + 1] * p[j + 1];
                    dp[i][j] = Math.min(dp[i][j], cost);
                }
            }
        }

        System.out.println(dp[0][n - 1]);
        sc.close();
    }
}

import java.util.Scanner;

public class MatrixChainMultiplication {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        int[] p = new int[n + 1];
        for (int i = 0; i < n; i++) {
            int r = sc.nextInt();
            int c = sc.nextInt();
            if (i == 0) {
                p[0] = r;
            }
            p[i + 1] = c;
        }

        int[][] dp = new int[n][n];

        for (int len = 2; len <= n; len++) {
            for (int i = 0; i <= n - len; i++) {
                int j = i + len - 1;
                dp[i][j] = Integer.MAX_VALUE;
                for (int k = i; k < j; k++) {
                    int cost = dp[i][k] + dp[k + 1][j] + p[i] * p[k + 1] * p[j + 1];
                    dp[i][j] = Math.min(dp[i][j], cost);
                }
            }
        }

        System.out.println(dp[0][n - 1]);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        int[] p = new int[n + 1];
        for (int i = 0; i < n; i++) {
            int r = sc.nextInt();
            int c = sc.nextInt();
            if (i == 0) {
                p[0] = r;
            }
            p[i + 1] = c;
        }

        int[][] dp = new int[n][n];

        for (int l = 2; l <= n; l++) {
            for (int i = 0; i <= n - l; i++) {
                int j = i + l - 1;
                dp[i][j] = Integer.MAX_VALUE;

                for (int k = i; k < j; k++) {
                    int cost = dp[i][k] + dp[k + 1][j] + p[i] * p[k + 1] * p[j + 1];
                    dp[i][j] = Math.min(dp[i][j], cost);
                }
            }
        }

        System.out.println(dp[0][n - 1]);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int q = sc.nextInt();
        sc.nextLine();

        for (int i = 0; i < q; i++) {
            String x = sc.nextLine();
            String y = sc.nextLine();
            System.out.println(lcs(x, y));
        }

        sc.close();
    }

    public static int lcs(String x, String y) {
        int m = x.length();
        int n = y.length();
        int[][] dp = new int[m + 1][n + 1];

        for (int i = 1; i <= m; i++) {
            for (int j = 1; j <= n; j++) {
                if (x.charAt(i - 1) == y.charAt(j - 1)) {
                    dp[i][j] = dp[i - 1][j - 1] + 1;
                } else {
                    dp[i][j] = Math.max(dp[i - 1][j], dp[i][j - 1]);
                }
            }
        }

        return dp[m][n];
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int q = sc.nextInt();
        sc.nextLine();

        for (int i = 0; i < q; i++) {
            String x = sc.nextLine();
            String y = sc.nextLine();
            System.out.println(lcs(x, y));
        }

        sc.close();
    }

    public static int lcs(String x, String y) {
        int m = x.length();
        int n = y.length();
        int[][] dp = new int[m + 1][n + 1];

        for (int i = 1; i <= m; i++) {
            for (int j = 1; j <= n; j++) {
                if (x.charAt(i - 1) == y.charAt(j - 1)) {
                    dp[i][j] = dp[i - 1][j - 1] + 1;
                } else {
                    dp[i][j] = Math.max(dp[i - 1][j], dp[i][j - 1]);
                }
            }
        }

        return dp[m][n];
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int q = sc.nextInt();
        sc.nextLine();

        for (int i = 0; i < q; i++) {
            String x = sc.nextLine();
            String y = sc.nextLine();
            System.out.println(lcs(x, y));
        }

        sc.close();
    }

    public static int lcs(String x, String y) {
        int m = x.length();
        int n = y.length();
        int[][] dp = new int[m + 1][n + 1];

        for (int i = 1; i <= m; i++) {
            for (int j = 1; j <= n; j++) {
                if (x.charAt(i - 1) == y.charAt(j - 1)) {
                    dp[i][j] = dp[i - 1][j - 1] + 1;
                } else {
                    dp[i][j] = Math.max(dp[i - 1][j], dp[i][j - 1]);
                }
            }
        }

        return dp[m][n];
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        int n = scanner.nextInt();
        int[][] matrix = new int[n][n];

        for (int i = 0; i < n; i++) {
            int u = scanner.nextInt() - 1;
            int k = scanner.nextInt();

            for (int j = 0; j < k; j++) {
                int v = scanner.nextInt() - 1;
                matrix[u][v] = 1;
            }
        }

        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                if (j > 0) System.out.print(" ");
                System.out.print(matrix[i][j]);
            }
            System.out.println();
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class Graph {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        int[][] matrix = new int[n][n];

        for (int i = 0; i < n; i++) {
            int u = sc.nextInt() - 1;
            int k = sc.nextInt();

            for (int j = 0; j < k; j++) {
                int v = sc.nextInt() - 1;
                matrix[u][v] = 1;
            }
        }

        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                if (j > 0) System.out.print(" ");
                System.out.print(matrix[i][j]);
            }
            System.out.println();
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();

        int[][] matrix = new int[n][n];

        for (int i = 0; i < n; i++) {
            int u = scanner.nextInt() - 1;
            int k = scanner.nextInt();

            for (int j = 0; j < k; j++) {
                int v = scanner.nextInt() - 1;
                matrix[u][v] = 1;
            }
        }

        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                if (j > 0) System.out.print(" ");
                System.out.print(matrix[i][j]);
            }
            System.out.println();
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        int[][] matrix = new int[n][n];

        for (int i = 0; i < n; i++) {
            int u = sc.nextInt() - 1;
            int k = sc.nextInt();

            for (int j = 0; j < k; j++) {
                int v = sc.nextInt() - 1;
                matrix[u][v] = 1;
            }
        }

        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                if (j > 0) System.out.print(" ");
                System.out.print(matrix[i][j]);
            }
            System.out.println();
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        int[][] matrix = new int[n][n];

        for (int i = 0; i < n; i++) {
            int u = sc.nextInt() - 1;
            int k = sc.nextInt();

            for (int j = 0; j < k; j++) {
                int v = sc.nextInt() - 1;
                matrix[u][v] = 1;
            }
        }

        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                if (j > 0) System.out.print(" ");
                System.out.print(matrix[i][j]);
            }
            System.out.println();
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        List<List<Integer>> graph = new ArrayList<>();
        for (int i = 0; i <= n; i++) {
            graph.add(new ArrayList<>());
        }

        for (int i = 0; i < n; i++) {
            int u = sc.nextInt();
            int k = sc.nextInt();
            for (int j = 0; j < k; j++) {
                int v = sc.nextInt();
                graph.get(u).add(v);
            }
        }

        int[] distance = new int[n + 1];
        Arrays.fill(distance, -1);
        distance[1] = 0;

        Queue<Integer> queue = new LinkedList<>();
        queue.offer(1);

        while (!queue.isEmpty()) {
            int current = queue.poll();

            for (int neighbor : graph.get(current)) {
                if (distance[neighbor] == -1) {
                    distance[neighbor] = distance[current] + 1;
                    queue.offer(neighbor);
                }
            }
        }

        for (int i = 1; i <= n; i++) {
            System.out.println(i + " " + distance[i]);
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        List<List<Integer>> graph = new ArrayList<>();
        for (int i = 0; i <= n; i++) {
            graph.add(new ArrayList<>());
        }

        for (int i = 0; i < n; i++) {
            int u = sc.nextInt();
            int k = sc.nextInt();
            for (int j = 0; j < k; j++) {
                int v = sc.nextInt();
                graph.get(u).add(v);
            }
        }

        int[] distance = new int[n + 1];
        Arrays.fill(distance, -1);
        distance[1] = 0;

        Queue<Integer> queue = new LinkedList<>();
        queue.offer(1);

        while (!queue.isEmpty()) {
            int current = queue.poll();

            for (int neighbor : graph.get(current)) {
                if (distance[neighbor] == -1) {
                    distance[neighbor] = distance[current] + 1;
                    queue.offer(neighbor);
                }
            }
        }

        for (int i = 1; i <= n; i++) {
            System.out.println(i + " " + distance[i]);
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        List<List<Integer>> graph = new ArrayList<>();
        for (int i = 0; i <= n; i++) {
            graph.add(new ArrayList<>());
        }

        for (int i = 0; i < n; i++) {
            int u = sc.nextInt();
            int k = sc.nextInt();
            for (int j = 0; j < k; j++) {
                int v = sc.nextInt();
                graph.get(u).add(v);
            }
        }

        int[] distance = new int[n + 1];
        Arrays.fill(distance, -1);
        distance[1] = 0;

        Queue<Integer> queue = new LinkedList<>();
        queue.offer(1);

        while (!queue.isEmpty()) {
            int current = queue.poll();
            for (int neighbor : graph.get(current)) {
                if (distance[neighbor] == -1) {
                    distance[neighbor] = distance[current] + 1;
                    queue.offer(neighbor);
                }
            }
        }

        for (int i = 1; i <= n; i++) {
            System.out.println(i + " " + distance[i]);
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        List<List<Integer>> graph = new ArrayList<>();
        for (int i = 0; i <= n; i++) {
            graph.add(new ArrayList<>());
        }

        for (int i = 0; i < n; i++) {
            int u = sc.nextInt();
            int k = sc.nextInt();
            for (int j = 0; j < k; j++) {
                int v = sc.nextInt();
                graph.get(u).add(v);
            }
        }

        int[] distance = new int[n + 1];
        Arrays.fill(distance, -1);
        distance[1] = 0;

        Queue<Integer> queue = new LinkedList<>();
        queue.offer(1);

        while (!queue.isEmpty()) {
            int current = queue.poll();

            for (int neighbor : graph.get(current)) {
                if (distance[neighbor] == -1) {
                    distance[neighbor] = distance[current] + 1;
                    queue.offer(neighbor);
                }
            }
        }

        for (int i = 1; i <= n; i++) {
            System.out.println(i + " " + distance[i]);
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        List<List<Integer>> graph = new ArrayList<>();
        for (int i = 0; i <= n; i++) {
            graph.add(new ArrayList<>());
        }

        for (int i = 0; i < n; i++) {
            int u = sc.nextInt();
            int k = sc.nextInt();
            for (int j = 0; j < k; j++) {
                int v = sc.nextInt();
                graph.get(u).add(v);
            }
        }

        int[] dist = new int[n + 1];
        Arrays.fill(dist, -1);
        Queue<Integer> queue = new LinkedList<>();

        dist[1] = 0;
        queue.offer(1);

        while (!queue.isEmpty()) {
            int curr = queue.poll();
            for (int next : graph.get(curr)) {
                if (dist[next] == -1) {
                    dist[next] = dist[curr] + 1;
                    queue.offer(next);
                }
            }
        }

        for (int i = 1; i <= n; i++) {
            System.out.println(i + " " + dist[i]);
        }

        sc.close();
    }
}

import java.util.*;

public class Main {

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();

        List<List<Integer>> adj = new ArrayList<>();
        for (int i = 0; i <= n; i++) {
            adj.add(new ArrayList<>());
        }

        for (int i = 0; i < n; i++) {
            int u = scanner.nextInt();
            int k = scanner.nextInt();
            for (int j = 0; j < k; j++) {
                int v = scanner.nextInt();
                adj.get(u).add(v);
            }
        }

        int[] dist = new int[n + 1];
        Arrays.fill(dist, -1);

        Queue<Integer> queue = new LinkedList<>();

        dist[1] = 0;
        queue.offer(1);

        while (!queue.isEmpty()) {
            int u = queue.poll();

            for (int v : adj.get(u)) {
                if (dist[v] == -1) {
                    dist[v] = dist[u] + 1;
                    queue.offer(v);
                }
            }
        }

        for (int i = 1; i <= n; i++) {
            System.out.println(i + " " + dist[i]);
        }

        scanner.close();
    }
}

import java.util.*;

public class Main {
    static class UnionFind {
        int[] parent;
        int[] rank;

        public UnionFind(int n) {
            parent = new int[n];
            rank = new int[n];
            for (int i = 0; i < n; i++) {
                parent[i] = i;
                rank[i] = 0;
            }
        }

        public int find(int x) {
            if (parent[x] != x) {
                parent[x] = find(parent[x]);
            }
            return parent[x];
        }

        public void union(int x, int y) {
            int rootX = find(x);
            int rootY = find(y);

            if (rootX != rootY) {
                if (rank[rootX] < rank[rootY]) {
                    parent[rootX] = rootY;
                } else if (rank[rootX] > rank[rootY]) {
                    parent[rootY] = rootX;
                } else {
                    parent[rootY] = rootX;
                    rank[rootX]++;
                }
            }
        }

        public boolean connected(int x, int y) {
            return find(x) == find(y);
        }
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        int m = sc.nextInt();

        UnionFind uf = new UnionFind(n);

        for (int i = 0; i < m; i++) {
            int s = sc.nextInt();
            int t = sc.nextInt();
            uf.union(s, t);
        }

        int q = sc.nextInt();
        for (int i = 0; i < q; i++) {
            int s = sc.nextInt();
            int t = sc.nextInt();
            if (uf.connected(s, t)) {
                System.out.println("yes");
            } else {
                System.out.println("no");
            }
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    static class UnionFind {
        int[] parent;
        int[] rank;

        public UnionFind(int n) {
            parent = new int[n];
            rank = new int[n];
            for (int i = 0; i < n; i++) {
                parent[i] = i;
                rank[i] = 0;
            }
        }

        public int find(int x) {
            if (parent[x] != x) {
                parent[x] = find(parent[x]);
            }
            return parent[x];
        }

        public void union(int x, int y) {
            int rootX = find(x);
            int rootY = find(y);

            if (rootX != rootY) {
                if (rank[rootX] < rank[rootY]) {
                    parent[rootX] = rootY;
                } else if (rank[rootX] > rank[rootY]) {
                    parent[rootY] = rootX;
                } else {
                    parent[rootY] = rootX;
                    rank[rootX]++;
                }
            }
        }

        public boolean connected(int x, int y) {
            return find(x) == find(y);
        }
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int m = sc.nextInt();

        UnionFind uf = new UnionFind(n);

        for (int i = 0; i < m; i++) {
            int s = sc.nextInt();
            int t = sc.nextInt();
            uf.union(s, t);
        }

        int q = sc.nextInt();
        for (int i = 0; i < q; i++) {
            int s = sc.nextInt();
            int t = sc.nextInt();
            if (uf.connected(s, t)) {
                System.out.println("yes");
            } else {
                System.out.println("no");
            }
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[][] adj = new int[n][n];

        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                adj[i][j] = sc.nextInt();
            }
        }

        boolean[] visited = new boolean[n];
        int[] key = new int[n];
        Arrays.fill(key, Integer.MAX_VALUE);
        key[0] = 0;

        int totalWeight = 0;

        for (int count = 0; count < n; count++) {
            int u = -1;
            for (int v = 0; v < n; v++) {
                if (!visited[v] && (u == -1 || key[v] < key[u])) {
                    u = v;
                }
            }

            visited[u] = true;
            totalWeight += key[u];

            for (int v = 0; v < n; v++) {
                if (!visited[v] && adj[u][v] != -1 && adj[u][v] < key[v]) {
                    key[v] = adj[u][v];
                }
            }
        }

        System.out.println(totalWeight);
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[][] adj = new int[n][n];

        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                adj[i][j] = sc.nextInt();
            }
        }

        boolean[] visited = new boolean[n];
        int[] key = new int[n];
        Arrays.fill(key, Integer.MAX_VALUE);

        key[0] = 0;
        int totalWeight = 0;

        for (int count = 0; count < n; count++) {
            int u = -1;
            for (int v = 0; v < n; v++) {
                if (!visited[v] && (u == -1 || key[v] < key[u])) {
                    u = v;
                }
            }

            visited[u] = true;
            totalWeight += key[u];

            for (int v = 0; v < n; v++) {
                if (!visited[v] && adj[u][v] != -1 && adj[u][v] < key[v]) {
                    key[v] = adj[u][v];
                }
            }
        }

        System.out.println(totalWeight);
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[][] adj = new int[n][n];

        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                adj[i][j] = sc.nextInt();
            }
        }

        boolean[] visited = new boolean[n];
        int[] key = new int[n];
        Arrays.fill(key, Integer.MAX_VALUE);
        key[0] = 0;

        int totalWeight = 0;

        for (int count = 0; count < n; count++) {
            int u = -1;
            for (int v = 0; v < n; v++) {
                if (!visited[v] && (u == -1 || key[v] < key[u])) {
                    u = v;
                }
            }

            visited[u] = true;
            totalWeight += key[u];

            for (int v = 0; v < n; v++) {
                if (!visited[v] && adj[u][v] != -1 && adj[u][v] < key[v]) {
                    key[v] = adj[u][v];
                }
            }
        }

        System.out.println(totalWeight);
    }
}

import java.util.*;

public class Main {
    static class Edge {
        int to, weight;
        Edge(int to, int weight) {
            this.to = to;
            this.weight = weight;
        }
    }

    static class Node implements Comparable<Node> {
        int vertex, distance;
        Node(int vertex, int distance) {
            this.vertex = vertex;
            this.distance = distance;
        }

        public int compareTo(Node other) {
            return Integer.compare(this.distance, other.distance);
        }
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        List<List<Edge>> graph = new ArrayList<>();
        for (int i = 0; i < n; i++) {
            graph.add(new ArrayList<>());
        }

        for (int i = 0; i < n; i++) {
            int u = sc.nextInt();
            int k = sc.nextInt();
            for (int j = 0; j < k; j++) {
                int v = sc.nextInt();
                int c = sc.nextInt();
                graph.get(u).add(new Edge(v, c));
            }
        }

        int[] dist = new int[n];
        Arrays.fill(dist, Integer.MAX_VALUE);
        dist[0] = 0;

        PriorityQueue<Node> pq = new PriorityQueue<>();
        pq.offer(new Node(0, 0));

        while (!pq.isEmpty()) {
            Node current = pq.poll();
            int u = current.vertex;
            int d = current.distance;

            if (d > dist[u]) continue;

            for (Edge edge : graph.get(u)) {
                int v = edge.to;
                int weight = edge.weight;

                if (dist[u] + weight < dist[v]) {
                    dist[v] = dist[u] + weight;
                    pq.offer(new Node(v, dist[v]));
                }
            }
        }

        for (int i = 0; i < n; i++) {
            System.out.println(i + " " + dist[i]);
        }
    }
}

import java.util.*;

public class Main {
    static class Edge {
        int to, weight;
        Edge(int to, int weight) {
            this.to = to;
            this.weight = weight;
        }
    }

    static class Node implements Comparable<Node> {
        int vertex, dist;
        Node(int vertex, int dist) {
            this.vertex = vertex;
            this.dist = dist;
        }

        public int compareTo(Node other) {
            return Integer.compare(this.dist, other.dist);
        }
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        List<List<Edge>> graph = new ArrayList<>();
        for (int i = 0; i < n; i++) {
            graph.add(new ArrayList<>());
        }

        for (int i = 0; i < n; i++) {
            int u = sc.nextInt();
            int k = sc.nextInt();
            for (int j = 0; j < k; j++) {
                int v = sc.nextInt();
                int c = sc.nextInt();
                graph.get(u).add(new Edge(v, c));
            }
        }

        int[] dist = new int[n];
        Arrays.fill(dist, Integer.MAX_VALUE);
        dist[0] = 0;

        PriorityQueue<Node> pq = new PriorityQueue<>();
        pq.offer(new Node(0, 0));

        while (!pq.isEmpty()) {
            Node current = pq.poll();
            int u = current.vertex;
            int d = current.dist;

            if (d > dist[u]) continue;

            for (Edge edge : graph.get(u)) {
                int v = edge.to;
                int weight = edge.weight;

                if (dist[u] + weight < dist[v]) {
                    dist[v] = dist[u] + weight;
                    pq.offer(new Node(v, dist[v]));
                }
            }
        }

        for (int i = 0; i < n; i++) {
            System.out.println(i + " " + dist[i]);
        }
    }
}

import java.util.*;

public class Main {
    static class Edge {
        int to, weight;
        Edge(int to, int weight) {
            this.to = to;
            this.weight = weight;
        }
    }

    static class Node implements Comparable<Node> {
        int vertex, dist;
        Node(int vertex, int dist) {
            this.vertex = vertex;
            this.dist = dist;
        }

        public int compareTo(Node other) {
            return Integer.compare(this.dist, other.dist);
        }
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        List<List<Edge>> graph = new ArrayList<>();
        for (int i = 0; i < n; i++) {
            graph.add(new ArrayList<>());
        }

        for (int i = 0; i < n; i++) {
            int u = sc.nextInt();
            int k = sc.nextInt();
            for (int j = 0; j < k; j++) {
                int v = sc.nextInt();
                int c = sc.nextInt();
                graph.get(u).add(new Edge(v, c));
            }
        }

        int[] dist = new int[n];
        Arrays.fill(dist, Integer.MAX_VALUE);
        dist[0] = 0;

        PriorityQueue<Node> pq = new PriorityQueue<>();
        pq.offer(new Node(0, 0));

        while (!pq.isEmpty()) {
            Node current = pq.poll();
            int u = current.vertex;
            int d = current.dist;

            if (d > dist[u]) continue;

            for (Edge edge : graph.get(u)) {
                int v = edge.to;
                int weight = edge.weight;
                if (dist[u] + weight < dist[v]) {
                    dist[v] = dist[u] + weight;
                    pq.offer(new Node(v, dist[v]));
                }
            }
        }

        for (int i = 0; i < n; i++) {
            System.out.println(i + " " + dist[i]);
        }
    }
}

import java.util.*;

public class Main {
    static class Edge {
        int to, weight;
        Edge(int to, int weight) {
            this.to = to;
            this.weight = weight;
        }
    }

    static class Node implements Comparable<Node> {
        int vertex, dist;
        Node(int vertex, int dist) {
            this.vertex = vertex;
            this.dist = dist;
        }

        public int compareTo(Node other) {
            return Integer.compare(this.dist, other.dist);
        }
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        List<List<Edge>> graph = new ArrayList<>();
        for (int i = 0; i < n; i++) {
            graph.add(new ArrayList<>());
        }

        for (int i = 0; i < n; i++) {
            int u = sc.nextInt();
            int k = sc.nextInt();
            for (int j = 0; j < k; j++) {
                int v = sc.nextInt();
                int c = sc.nextInt();
                graph.get(u).add(new Edge(v, c));
            }
        }

        int[] dist = new int[n];
        Arrays.fill(dist, Integer.MAX_VALUE);
        dist[0] = 0;

        PriorityQueue<Node> pq = new PriorityQueue<>();
        pq.offer(new Node(0, 0));

        while (!pq.isEmpty()) {
            Node current = pq.poll();
            int u = current.vertex;
            int d = current.dist;

            if (d > dist[u]) continue;

            for (Edge edge : graph.get(u)) {
                int v = edge.to;
                int weight = edge.weight;

                if (dist[u] + weight < dist[v]) {
                    dist[v] = dist[u] + weight;
                    pq.offer(new Node(v, dist[v]));
                }
            }
        }

        for (int i = 0; i < n; i++) {
            System.out.println(i + " " + dist[i]);
        }
    }
}

import java.util.*;

public class Main {
    static class Edge {
        int to, weight;
        Edge(int to, int weight) {
            this.to = to;
            this.weight = weight;
        }
    }

    static class Node implements Comparable<Node> {
        int vertex, dist;
        Node(int vertex, int dist) {
            this.vertex = vertex;
            this.dist = dist;
        }

        public int compareTo(Node other) {
            return Integer.compare(this.dist, other.dist);
        }
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        List<List<Edge>> graph = new ArrayList<>();
        for (int i = 0; i < n; i++) {
            graph.add(new ArrayList<>());
        }

        for (int i = 0; i < n; i++) {
            int u = sc.nextInt();
            int k = sc.nextInt();
            for (int j = 0; j < k; j++) {
                int v = sc.nextInt();
                int c = sc.nextInt();
                graph.get(u).add(new Edge(v, c));
            }
        }

        int[] dist = new int[n];
        Arrays.fill(dist, Integer.MAX_VALUE);
        dist[0] = 0;

        PriorityQueue<Node> pq = new PriorityQueue<>();
        pq.offer(new Node(0, 0));

        while (!pq.isEmpty()) {
            Node current = pq.poll();
            int u = current.vertex;
            int d = current.dist;

            if (d > dist[u]) continue;

            for (Edge edge : graph.get(u)) {
                int v = edge.to;
                int newDist = dist[u] + edge.weight;

                if (newDist < dist[v]) {
                    dist[v] = newDist;
                    pq.offer(new Node(v, newDist));
                }
            }
        }

        for (int i = 0; i < n; i++) {
            System.out.println(i + " " + dist[i]);
        }
    }
}

import java.util.*;

public class Main {
    static class Edge {
        int to, weight;
        Edge(int to, int weight) {
            this.to = to;
            this.weight = weight;
        }
    }

    static class Node implements Comparable<Node> {
        int vertex, dist;
        Node(int vertex, int dist) {
            this.vertex = vertex;
            this.dist = dist;
        }

        public int compareTo(Node other) {
            return Integer.compare(this.dist, other.dist);
        }
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        List<List<Edge>> graph = new ArrayList<>();
        for (int i = 0; i < n; i++) {
            graph.add(new ArrayList<>());
        }

        for (int i = 0; i < n; i++) {
            int u = sc.nextInt();
            int k = sc.nextInt();
            for (int j = 0; j < k; j++) {
                int v = sc.nextInt();
                int c = sc.nextInt();
                graph.get(u).add(new Edge(v, c));
            }
        }

        int[] dist = new int[n];
        Arrays.fill(dist, Integer.MAX_VALUE);
        dist[0] = 0;

        PriorityQueue<Node> pq = new PriorityQueue<>();
        pq.offer(new Node(0, 0));

        while (!pq.isEmpty()) {
            Node current = pq.poll();
            int u = current.vertex;
            int d = current.dist;

            if (d > dist[u]) continue;

            for (Edge edge : graph.get(u)) {
                int v = edge.to;
                int newDist = dist[u] + edge.weight;

                if (newDist < dist[v]) {
                    dist[v] = newDist;
                    pq.offer(new Node(v, newDist));
                }
            }
        }

        for (int i = 0; i < n; i++) {
            System.out.println(i + " " + dist[i]);
        }
    }
}

import java.util.*;

public class Main {
    static class Edge {
        int to, weight;
        Edge(int to, int weight) {
            this.to = to;
            this.weight = weight;
        }
    }

    static class Node implements Comparable<Node> {
        int vertex, dist;
        Node(int vertex, int dist) {
            this.vertex = vertex;
            this.dist = dist;
        }

        public int compareTo(Node other) {
            return Integer.compare(this.dist, other.dist);
        }
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        List<List<Edge>> graph = new ArrayList<>();
        for (int i = 0; i < n; i++) {
            graph.add(new ArrayList<>());
        }

        for (int i = 0; i < n; i++) {
            int u = sc.nextInt();
            int k = sc.nextInt();
            for (int j = 0; j < k; j++) {
                int v = sc.nextInt();
                int c = sc.nextInt();
                graph.get(u).add(new Edge(v, c));
            }
        }

        int[] dist = new int[n];
        Arrays.fill(dist, Integer.MAX_VALUE);
        dist[0] = 0;

        PriorityQueue<Node> pq = new PriorityQueue<>();
        pq.offer(new Node(0, 0));

        while (!pq.isEmpty()) {
            Node current = pq.poll();
            int u = current.vertex;
            int d = current.dist;

            if (d > dist[u]) continue;

            for (Edge edge : graph.get(u)) {
                int v = edge.to;
                int newDist = dist[u] + edge.weight;
                if (newDist < dist[v]) {
                    dist[v] = newDist;
                    pq.offer(new Node(v, newDist));
                }
            }
        }

        for (int i = 0; i < n; i++) {
            System.out.println(i + " " + dist[i]);
        }
    }
}

import java.util.*;

public class Main {
    static final int[][] TARGET = {{1, 2, 3}, {4, 5, 6}, {7, 8, 0}};
    static final int[] dx = {-1, 1, 0, 0};
    static final int[] dy = {0, 0, -1, 1};

    static class State {
        int[][] board;
        int zeroX, zeroY;
        int steps;

        State(int[][] board, int zeroX, int zeroY, int steps) {
            this.board = new int[3][3];
            for (int i = 0; i < 3; i++) {
                System.arraycopy(board[i], 0, this.board[i], 0, 3);
            }
            this.zeroX = zeroX;
            this.zeroY = zeroY;
            this.steps = steps;
        }

        String getKey() {
            StringBuilder sb = new StringBuilder();
            for (int i = 0; i < 3; i++) {
                for (int j = 0; j < 3; j++) {
                    sb.append(board[i][j]);
                }
            }
            return sb.toString();
        }

        boolean isTarget() {
            for (int i = 0; i < 3; i++) {
                for (int j = 0; j < 3; j++) {
                    if (board[i][j] != TARGET[i][j]) {
                        return false;
                    }
                }
            }
            return true;
        }
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int[][] initial = new int[3][3];
        int zeroX = 0, zeroY = 0;

        for (int i = 0; i < 3; i++) {
            for (int j = 0; j < 3; j++) {
                initial[i][j] = sc.nextInt();
                if (initial[i][j] == 0) {
                    zeroX = i;
                    zeroY = j;
                }
            }
        }

        Queue<State> queue = new LinkedList<>();
        Set<String> visited = new HashSet<>();

        State start = new State(initial, zeroX, zeroY, 0);
        queue.offer(start);
        visited.add(start.getKey());

        while (!queue.isEmpty()) {
            State current = queue.poll();

            if (current.isTarget()) {
                System.out.println(current.steps);
                return;
            }

            for (int i = 0; i < 4; i++) {
                int newX = current.zeroX + dx[i];
                int newY = current.zeroY + dy[i];

                if (newX >= 0 && newX < 3 && newY >= 0 && newY < 3) {
                    int[][] newBoard = new int[3][3];
                    for (int r = 0; r < 3; r++) {
                        System.arraycopy(current.board[r], 0, newBoard[r], 0, 3);
                    }

                    newBoard[current.zeroX][current.zeroY] = newBoard[newX][newY];
                    newBoard[newX][newY] = 0;

                    State newState = new State(newBoard, newX, newY, current.steps + 1);
                    String key = newState.getKey();

                    if (!visited.contains(key)) {
                        visited.add(key);
                        queue.offer(newState);
                    }
                }
            }
        }
    }
}

import java.util.*;

public class Main {
    static final int[][] TARGET = {{1, 2, 3}, {4, 5, 6}, {7, 8, 0}};
    static final int[] dx = {-1, 1, 0, 0};
    static final int[] dy = {0, 0, -1, 1};

    static class State {
        int[][] board;
        int zeroX, zeroY;
        int steps;

        State(int[][] board, int zeroX, int zeroY, int steps) {
            this.board = new int[3][3];
            for (int i = 0; i < 3; i++) {
                System.arraycopy(board[i], 0, this.board[i], 0, 3);
            }
            this.zeroX = zeroX;
            this.zeroY = zeroY;
            this.steps = steps;
        }

        String getKey() {
            StringBuilder sb = new StringBuilder();
            for (int i = 0; i < 3; i++) {
                for (int j = 0; j < 3; j++) {
                    sb.append(board[i][j]);
                }
            }
            return sb.toString();
        }

        boolean isTarget() {
            for (int i = 0; i < 3; i++) {
                for (int j = 0; j < 3; j++) {
                    if (board[i][j] != TARGET[i][j]) {
                        return false;
                    }
                }
            }
            return true;
        }
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int[][] initial = new int[3][3];
        int zeroX = 0, zeroY = 0;

        for (int i = 0; i < 3; i++) {
            for (int j = 0; j < 3; j++) {
                initial[i][j] = sc.nextInt();
                if (initial[i][j] == 0) {
                    zeroX = i;
                    zeroY = j;
                }
            }
        }

        Queue<State> queue = new LinkedList<>();
        Set<String> visited = new HashSet<>();

        State start = new State(initial, zeroX, zeroY, 0);
        queue.offer(start);
        visited.add(start.getKey());

        while (!queue.isEmpty()) {
            State current = queue.poll();

            if (current.isTarget()) {
                System.out.println(current.steps);
                return;
            }

            for (int d = 0; d < 4; d++) {
                int nx = current.zeroX + dx[d];
                int ny = current.zeroY + dy[d];

                if (nx >= 0 && nx < 3 && ny >= 0 && ny < 3) {
                    int[][] newBoard = new int[3][3];
                    for (int i = 0; i < 3; i++) {
                        System.arraycopy(current.board[i], 0, newBoard[i], 0, 3);
                    }

                    newBoard[current.zeroX][current.zeroY] = newBoard[nx][ny];
                    newBoard[nx][ny] = 0;

                    State newState = new State(newBoard, nx, ny, current.steps + 1);
                    String key = newState.getKey();

                    if (!visited.contains(key)) {
                        visited.add(key);
                        queue.offer(newState);
                    }
                }
            }
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        String T = scanner.nextLine();
        String P = scanner.nextLine();

        for (int i = 0; i <= T.length() - P.length(); i++) {
            if (T.substring(i, i + P.length()).equals(P)) {
                System.out.println(i);
            }
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        String T = scanner.nextLine();
        String P = scanner.nextLine();

        for (int i = 0; i <= T.length() - P.length(); i++) {
            if (T.substring(i, i + P.length()).equals(P)) {
                System.out.println(i);
            }
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String T = sc.nextLine();
        String P = sc.nextLine();

        int[] lps = computeLPS(P);

        int i = 0;
        int j = 0;

        while (i < T.length()) {
            if (T.charAt(i) == P.charAt(j)) {
                i++;
                j++;
            }

            if (j == P.length()) {
                System.out.println(i - j);
                j = lps[j - 1];
            } else if (i < T.length() && T.charAt(i) != P.charAt(j)) {
                if (j != 0) {
                    j = lps[j - 1];
                } else {
                    i++;
                }
            }
        }
    }

    private static int[] computeLPS(String pattern) {
        int[] lps = new int[pattern.length()];
        int len = 0;
        int i = 1;

        while (i < pattern.length()) {
            if (pattern.charAt(i) == pattern.charAt(len)) {
                len++;
                lps[i] = len;
                i++;
            } else {
                if (len != 0) {
                    len = lps[len - 1];
                } else {
                    lps[i] = 0;
                    i++;
                }
            }
        }
        return lps;
    }
}

import java.util.Scanner;

public class StringSearch {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        String T = scanner.nextLine();
        String P = scanner.nextLine();

        int[] lps = computeLPSArray(P);
        int i = 0;
        int j = 0;

        while (i < T.length()) {
            if (P.charAt(j) == T.charAt(i)) {
                i++;
                j++;
            }
            if (j == P.length()) {
                System.out.println(i - j);
                j = lps[j - 1];
            } else if (i < T.length() && P.charAt(j) != T.charAt(i)) {
                if (j != 0) {
                    j = lps[j - 1];
                } else {
                    i++;
                }
            }
        }
    }

    private static int[] computeLPSArray(String pattern) {
        int[] lps = new int[pattern.length()];
        int len = 0;
        int i = 1;

        while (i < pattern.length()) {
            if (pattern.charAt(i) == pattern.charAt(len)) {
                len++;
                lps[i] = len;
                i++;
            } else {
                if (len != 0) {
                    len = lps[len - 1];
                } else {
                    lps[i] = 0;
                    i++;
                }
            }
        }
        return lps;
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String T = sc.nextLine();
        String P = sc.nextLine();

        for (int i = 0; i <= T.length() - P.length(); i++) {
            if (T.substring(i, i + P.length()).equals(P)) {
                System.out.println(i);
            }
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String T = sc.nextLine();
        String P = sc.nextLine();

        for (int i = 0; i <= T.length() - P.length(); i++) {
            if (T.substring(i, i + P.length()).equals(P)) {
                System.out.println(i);
            }
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        String T = scanner.nextLine();
        String P = scanner.nextLine();

        for (int i = 0; i <= T.length() - P.length(); i++) {
            if (T.substring(i, i + P.length()).equals(P)) {
                System.out.println(i);
            }
        }
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String T = sc.nextLine();
        String P = sc.nextLine();

        int[] lps = computeLPS(P);

        int i = 0;
        int j = 0;

        while (i < T.length()) {
            if (T.charAt(i) == P.charAt(j)) {
                i++;
                j++;
            }

            if (j == P.length()) {
                System.out.println(i - j);
                j = lps[j - 1];
            } else if (i < T.length() && T.charAt(i) != P.charAt(j)) {
                if (j != 0) {
                    j = lps[j - 1];
                } else {
                    i++;
                }
            }
        }
    }

    private static int[] computeLPS(String P) {
        int[] lps = new int[P.length()];
        int len = 0;
        int i = 1;

        while (i < P.length()) {
            if (P.charAt(i) == P.charAt(len)) {
                len++;
                lps[i] = len;
                i++;
            } else {
                if (len != 0) {
                    len = lps[len - 1];
                } else {
                    lps[i] = 0;
                    i++;
                }
            }
        }
        return lps;
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String T = sc.nextLine();
        String P = sc.nextLine();

        int[] lps = computeLPS(P);

        int i = 0;
        int j = 0;

        while (i < T.length()) {
            if (T.charAt(i) == P.charAt(j)) {
                i++;
                j++;
            }

            if (j == P.length()) {
                System.out.println(i - j);
                j = lps[j - 1];
            } else if (i < T.length() && T.charAt(i) != P.charAt(j)) {
                if (j != 0) {
                    j = lps[j - 1];
                } else {
                    i++;
                }
            }
        }
    }

    private static int[] computeLPS(String pattern) {
        int[] lps = new int[pattern.length()];
        int len = 0;
        int i = 1;

        while (i < pattern.length()) {
            if (pattern.charAt(i) == pattern.charAt(len)) {
                len++;
                lps[i] = len;
                i++;
            } else {
                if (len != 0) {
                    len = lps[len - 1];
                } else {
                    lps[i] = 0;
                    i++;
                }
            }
        }
        return lps;
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] arr = new int[n];

        for (int i = 0; i < n; i++) {
            arr[i] = sc.nextInt();
        }

        printArray(arr);

        for (int i = 1; i < n; i++) {
            int key = arr[i];
            int j = i - 1;

            while (j >= 0 && arr[j] > key) {
                arr[j + 1] = arr[j];
                j--;
            }
            arr[j + 1] = key;

            printArray(arr);
        }

        sc.close();
    }

    static void printArray(int[] arr) {
        for (int i = 0; i < arr.length; i++) {
            if (i > 0) System.out.print(" ");
            System.out.print(arr[i]);
        }
        System.out.println();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] A = new int[n];

        for (int i = 0; i < n; i++) {
            A[i] = sc.nextInt();
        }

        printArray(A);

        for (int i = 1; i < n; i++) {
            int key = A[i];
            int j = i - 1;

            while (j >= 0 && A[j] > key) {
                A[j + 1] = A[j];
                j--;
            }
            A[j + 1] = key;

            printArray(A);
        }

        sc.close();
    }

    static void printArray(int[] arr) {
        for (int i = 0; i < arr.length; i++) {
            if (i > 0) System.out.print(" ");
            System.out.print(arr[i]);
        }
        System.out.println();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int a = scanner.nextInt();
        int b = scanner.nextInt();

        System.out.println(gcd(a, b));
    }

    public static int gcd(int x, int y) {
        if (y == 0) {
            return x;
        }
        return gcd(y, x % y);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int a = scanner.nextInt();
        int b = scanner.nextInt();

        System.out.println(gcd(a, b));
    }

    public static int gcd(int x, int y) {
        if (y == 0) {
            return x;
        }
        return gcd(y, x % y);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int a = sc.nextInt();
        int b = sc.nextInt();

        System.out.println(gcd(a, b));
    }

    static int gcd(int x, int y) {
        if (y == 0) {
            return x;
        }
        return gcd(y, x % y);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int a = sc.nextInt();
        int b = sc.nextInt();

        System.out.println(gcd(a, b));
    }

    static int gcd(int x, int y) {
        if (y == 0) {
            return x;
        }
        return gcd(y, x % y);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int primeCount = 0;

        for (int i = 0; i < n; i++) {
            int num = sc.nextInt();
            if (isPrime(num)) {
                primeCount++;
            }
        }

        System.out.println(primeCount);
        sc.close();
    }

    public static boolean isPrime(int num) {
        if (num < 2) return false;
        if (num == 2) return true;
        if (num % 2 == 0) return false;

        for (int i = 3; i * i <= num; i += 2) {
            if (num % i == 0) {
                return false;
            }
        }
        return true;
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int primeCount = 0;

        for (int i = 0; i < n; i++) {
            int num = sc.nextInt();
            if (isPrime(num)) {
                primeCount++;
            }
        }

        System.out.println(primeCount);
        sc.close();
    }

    public static boolean isPrime(int num) {
        if (num < 2) return false;
        if (num == 2) return true;
        if (num % 2 == 0) return false;

        for (int i = 3; i * i <= num; i += 2) {
            if (num % i == 0) {
                return false;
            }
        }
        return true;
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int primeCount = 0;

        for (int i = 0; i < n; i++) {
            int num = sc.nextInt();
            if (isPrime(num)) {
                primeCount++;
            }
        }

        System.out.println(primeCount);
        sc.close();
    }

    public static boolean isPrime(int num) {
        if (num < 2) return false;
        if (num == 2) return true;
        if (num % 2 == 0) return false;

        for (int i = 3; i * i <= num; i += 2) {
            if (num % i == 0) {
                return false;
            }
        }
        return true;
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int primeCount = 0;

        for (int i = 0; i < n; i++) {
            int num = sc.nextInt();
            if (isPrime(num)) {
                primeCount++;
            }
        }

        System.out.println(primeCount);
        sc.close();
    }

    public static boolean isPrime(int num) {
        if (num < 2) return false;
        if (num == 2) return true;
        if (num % 2 == 0) return false;

        for (int i = 3; i * i <= num; i += 2) {
            if (num % i == 0) {
                return false;
            }
        }
        return true;
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        int[] rates = new int[n];
        for (int i = 0; i < n; i++) {
            rates[i] = sc.nextInt();
        }

        int maxProfit = Integer.MIN_VALUE;
        int minRate = rates[0];

        for (int i = 1; i < n; i++) {
            maxProfit = Math.max(maxProfit, rates[i] - minRate);
            minRate = Math.min(minRate, rates[i]);
        }

        System.out.println(maxProfit);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] R = new int[n];
        for (int i = 0; i < n; i++) {
            R[i] = sc.nextInt();
        }

        int maxProfit = Integer.MIN_VALUE;
        int minPrice = R[0];

        for (int j = 1; j < n; j++) {
            maxProfit = Math.max(maxProfit, R[j] - minPrice);
            minPrice = Math.min(minPrice, R[j]);
        }

        System.out.println(maxProfit);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        int[] rates = new int[n];
        for (int i = 0; i < n; i++) {
            rates[i] = sc.nextInt();
        }

        int maxProfit = Integer.MIN_VALUE;
        int minPrice = rates[0];

        for (int i = 1; i < n; i++) {
            maxProfit = Math.max(maxProfit, rates[i] - minPrice);
            minPrice = Math.min(minPrice, rates[i]);
        }

        System.out.println(maxProfit);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        int[] rates = new int[n];
        for (int i = 0; i < n; i++) {
            rates[i] = sc.nextInt();
        }

        int maxProfit = Integer.MIN_VALUE;
        int minPrice = rates[0];

        for (int i = 1; i < n; i++) {
            maxProfit = Math.max(maxProfit, rates[i] - minPrice);
            minPrice = Math.min(minPrice, rates[i]);
        }

        System.out.println(maxProfit);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        int[] rates = new int[n];
        for (int i = 0; i < n; i++) {
            rates[i] = sc.nextInt();
        }

        int maxProfit = Integer.MIN_VALUE;
        int minPrice = rates[0];

        for (int i = 1; i < n; i++) {
            maxProfit = Math.max(maxProfit, rates[i] - minPrice);
            minPrice = Math.min(minPrice, rates[i]);
        }

        System.out.println(maxProfit);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        int n = scanner.nextInt();
        int[] arr = new int[n];

        for (int i = 0; i < n; i++) {
            arr[i] = scanner.nextInt();
        }

        int swapCount = 0;

        for (int i = 0; i < arr.length - 1; i++) {
            int mini = i;
            for (int j = i; j < arr.length; j++) {
                if (arr[j] < arr[mini]) {
                    mini = j;
                }
            }
            if (i != mini) {
                int temp = arr[i];
                arr[i] = arr[mini];
                arr[mini] = temp;
                swapCount++;
            }
        }

        for (int i = 0; i < arr.length; i++) {
            if (i > 0) System.out.print(" ");
            System.out.print(arr[i]);
        }
        System.out.println();

        System.out.println(swapCount);

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        int n = scanner.nextInt();
        int[] A = new int[n];

        for (int i = 0; i < n; i++) {
            A[i] = scanner.nextInt();
        }

        int swapCount = 0;

        for (int i = 0; i < A.length - 1; i++) {
            int mini = i;
            for (int j = i; j < A.length; j++) {
                if (A[j] < A[mini]) {
                    mini = j;
                }
            }
            if (i != mini) {
                int temp = A[i];
                A[i] = A[mini];
                A[mini] = temp;
                swapCount++;
            }
        }

        for (int i = 0; i < A.length; i++) {
            if (i > 0) System.out.print(" ");
            System.out.print(A[i]);
        }
        System.out.println();

        System.out.println(swapCount);

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        int n = scanner.nextInt();
        int[] a = new int[n];

        for (int i = 0; i < n; i++) {
            a[i] = scanner.nextInt();
        }

        int swapCount = 0;

        for (int i = 0; i < n - 1; i++) {
            int mini = i;
            for (int j = i; j < n; j++) {
                if (a[j] < a[mini]) {
                    mini = j;
                }
            }
            if (i != mini) {
                int temp = a[i];
                a[i] = a[mini];
                a[mini] = temp;
                swapCount++;
            }
        }

        for (int i = 0; i < n; i++) {
            if (i > 0) System.out.print(" ");
            System.out.print(a[i]);
        }
        System.out.println();

        System.out.println(swapCount);

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] a = new int[n];

        for (int i = 0; i < n; i++) {
            a[i] = sc.nextInt();
        }

        int swapCount = 0;

        for (int i = 0; i < n - 1; i++) {
            int mini = i;
            for (int j = i; j < n; j++) {
                if (a[j] < a[mini]) {
                    mini = j;
                }
            }
            if (i != mini) {
                int temp = a[i];
                a[i] = a[mini];
                a[mini] = temp;
                swapCount++;
            }
        }

        for (int i = 0; i < n; i++) {
            if (i > 0) System.out.print(" ");
            System.out.print(a[i]);
        }
        System.out.println();

        System.out.println(swapCount);

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String[] tokens = sc.nextLine().split(" ");

        Deque<Integer> stack = new ArrayDeque<>();

        for (String token : tokens) {
            if (token.equals("+")) {
                int b = stack.pop();
                int a = stack.pop();
                stack.push(a + b);
            } else if (token.equals("-")) {
                int b = stack.pop();
                int a = stack.pop();
                stack.push(a - b);
            } else if (token.equals("*")) {
                int b = stack.pop();
                int a = stack.pop();
                stack.push(a * b);
            } else {
                stack.push(Integer.parseInt(token));
            }
        }

        System.out.println(stack.pop());
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String[] tokens = sc.nextLine().split(" ");

        Stack<Integer> stack = new Stack<>();

        for (String token : tokens) {
            if (token.equals("+")) {
                int b = stack.pop();
                int a = stack.pop();
                stack.push(a + b);
            } else if (token.equals("-")) {
                int b = stack.pop();
                int a = stack.pop();
                stack.push(a - b);
            } else if (token.equals("*")) {
                int b = stack.pop();
                int a = stack.pop();
                stack.push(a * b);
            } else {
                stack.push(Integer.parseInt(token));
            }
        }

        System.out.println(stack.pop());
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String[] tokens = sc.nextLine().split(" ");

        Stack<Integer> stack = new Stack<>();

        for (String token : tokens) {
            if (token.equals("+")) {
                int b = stack.pop();
                int a = stack.pop();
                stack.push(a + b);
            } else if (token.equals("-")) {
                int b = stack.pop();
                int a = stack.pop();
                stack.push(a - b);
            } else if (token.equals("*")) {
                int b = stack.pop();
                int a = stack.pop();
                stack.push(a * b);
            } else {
                stack.push(Integer.parseInt(token));
            }
        }

        System.out.println(stack.pop());
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        String[] tokens = scanner.nextLine().split(" ");

        Stack<Integer> stack = new Stack<>();

        for (String token : tokens) {
            if (token.equals("+")) {
                int b = stack.pop();
                int a = stack.pop();
                stack.push(a + b);
            } else if (token.equals("-")) {
                int b = stack.pop();
                int a = stack.pop();
                stack.push(a - b);
            } else if (token.equals("*")) {
                int b = stack.pop();
                int a = stack.pop();
                stack.push(a * b);
            } else {
                stack.push(Integer.parseInt(token));
            }
        }

        System.out.println(stack.pop());
    }
}

import java.util.*;

public class Main {
    static class Process {
        String name;
        int time;

        Process(String name, int time) {
            this.name = name;
            this.time = time;
        }
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int q = sc.nextInt();

        Queue<Process> queue = new LinkedList<>();

        for (int i = 0; i < n; i++) {
            String name = sc.next();
            int time = sc.nextInt();
            queue.offer(new Process(name, time));
        }

        int currentTime = 0;

        while (!queue.isEmpty()) {
            Process current = queue.poll();

            if (current.time <= q) {
                currentTime += current.time;
                System.out.println(current.name + " " + currentTime);
            } else {
                currentTime += q;
                current.time -= q;
                queue.offer(current);
            }
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    static class Process {
        String name;
        int time;

        Process(String name, int time) {
            this.name = name;
            this.time = time;
        }
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int q = sc.nextInt();

        Queue<Process> queue = new LinkedList<>();

        for (int i = 0; i < n; i++) {
            String name = sc.next();
            int time = sc.nextInt();
            queue.offer(new Process(name, time));
        }

        int currentTime = 0;

        while (!queue.isEmpty()) {
            Process p = queue.poll();

            if (p.time <= q) {
                currentTime += p.time;
                System.out.println(p.name + " " + currentTime);
            } else {
                currentTime += q;
                p.time -= q;
                queue.offer(p);
            }
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    static class Process {
        String name;
        int time;

        Process(String name, int time) {
            this.name = name;
            this.time = time;
        }
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int q = sc.nextInt();

        Queue<Process> queue = new LinkedList<>();

        for (int i = 0; i < n; i++) {
            String name = sc.next();
            int time = sc.nextInt();
            queue.offer(new Process(name, time));
        }

        int currentTime = 0;

        while (!queue.isEmpty()) {
            Process current = queue.poll();

            if (current.time <= q) {
                currentTime += current.time;
                System.out.println(current.name + " " + currentTime);
            } else {
                currentTime += q;
                current.time -= q;
                queue.offer(current);
            }
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String s = sc.nextLine();

        Stack<Integer> stack = new Stack<>();
        Stack<Pair> pools = new Stack<>();

        for (int i = 0; i < s.length(); i++) {
            char c = s.charAt(i);

            if (c == '\\') {
                stack.push(i);
            } else if (c == '/' && !stack.isEmpty()) {
                int start = stack.pop();
                int area = i - start;

                int totalArea = area;
                while (!pools.isEmpty() && pools.peek().pos > start) {
                    totalArea += pools.pop().area;
                }

                pools.push(new Pair(start, totalArea));
            }
        }

        int totalArea = 0;
        List<Integer> areas = new ArrayList<>();

        while (!pools.isEmpty()) {
            Pair p = pools.pop();
            totalArea += p.area;
            areas.add(p.area);
        }

        Collections.reverse(areas);

        System.out.println(totalArea);
        System.out.print(areas.size());
        for (int area : areas) {
            System.out.print(" " + area);
        }
        System.out.println();
    }

    static class Pair {
        int pos;
        int area;

        Pair(int pos, int area) {
            this.pos = pos;
            this.area = area;
        }
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String s = sc.nextLine();

        Stack<Integer> stack = new Stack<>();
        Stack<Pair> pools = new Stack<>();

        for (int i = 0; i < s.length(); i++) {
            char c = s.charAt(i);

            if (c == '\\') {
                stack.push(i);
            } else if (c == '/' && !stack.isEmpty()) {
                int start = stack.pop();
                int area = i - start;

                int totalArea = area;
                while (!pools.isEmpty() && pools.peek().start > start) {
                    totalArea += pools.pop().area;
                }
                pools.push(new Pair(start, totalArea));
            }
        }

        int totalArea = 0;
        List<Integer> areas = new ArrayList<>();

        while (!pools.isEmpty()) {
            Pair p = pools.pop();
            totalArea += p.area;
            areas.add(p.area);
        }

        Collections.reverse(areas);

        System.out.println(totalArea);
        System.out.print(areas.size());
        for (int area : areas) {
            System.out.print(" " + area);
        }
        System.out.println();
    }

    static class Pair {
        int start;
        int area;

        Pair(int start, int area) {
            this.start = start;
            this.area = area;
        }
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        Set<Integer> S = new HashSet<>();
        for (int i = 0; i < n; i++) {
            S.add(sc.nextInt());
        }

        int q = sc.nextInt();
        int count = 0;
        for (int i = 0; i < q; i++) {
            int t = sc.nextInt();
            if (S.contains(t)) {
                count++;
            }
        }

        System.out.println(count);
        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        Set<Integer> s = new HashSet<>();
        for (int i = 0; i < n; i++) {
            s.add(sc.nextInt());
        }

        int q = sc.nextInt();
        int count = 0;
        for (int i = 0; i < q; i++) {
            int t = sc.nextInt();
            if (s.contains(t)) {
                count++;
            }
        }

        System.out.println(count);
        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        Set<Integer> S = new HashSet<>();
        for (int i = 0; i < n; i++) {
            S.add(sc.nextInt());
        }

        int q = sc.nextInt();
        int count = 0;
        for (int i = 0; i < q; i++) {
            int t = sc.nextInt();
            if (S.contains(t)) {
                count++;
            }
        }

        System.out.println(count);
        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        Set<Integer> S = new HashSet<>();
        for (int i = 0; i < n; i++) {
            S.add(sc.nextInt());
        }

        int q = sc.nextInt();
        int count = 0;
        for (int i = 0; i < q; i++) {
            int t = sc.nextInt();
            if (S.contains(t)) {
                count++;
            }
        }

        System.out.println(count);
        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        Set<Integer> sSet = new HashSet<>();

        for (int i = 0; i < n; i++) {
            sSet.add(sc.nextInt());
        }

        int q = sc.nextInt();
        int count = 0;

        for (int i = 0; i < q; i++) {
            int target = sc.nextInt();
            if (sSet.contains(target)) {
                count++;
            }
        }

        System.out.println(count);
        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        Set<Integer> s = new HashSet<>();
        for (int i = 0; i < n; i++) {
            s.add(sc.nextInt());
        }

        int q = sc.nextInt();
        int count = 0;
        for (int i = 0; i < q; i++) {
            int t = sc.nextInt();
            if (s.contains(t)) {
                count++;
            }
        }

        System.out.println(count);
        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        Set<Integer> S = new HashSet<>();
        for (int i = 0; i < n; i++) {
            S.add(sc.nextInt());
        }

        int q = sc.nextInt();
        int count = 0;
        for (int i = 0; i < q; i++) {
            int t = sc.nextInt();
            if (S.contains(t)) {
                count++;
            }
        }

        System.out.println(count);
        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        Set<Integer> S = new HashSet<>();
        for (int i = 0; i < n; i++) {
            S.add(sc.nextInt());
        }

        int q = sc.nextInt();
        int count = 0;
        for (int i = 0; i < q; i++) {
            int t = sc.nextInt();
            if (S.contains(t)) {
                count++;
            }
        }

        System.out.println(count);
        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        Set<Integer> S = new HashSet<>();
        for (int i = 0; i < n; i++) {
            S.add(sc.nextInt());
        }

        int q = sc.nextInt();
        int count = 0;
        for (int i = 0; i < q; i++) {
            int t = sc.nextInt();
            if (S.contains(t)) {
                count++;
            }
        }

        System.out.println(count);
        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        sc.nextLine();

        Set<String> dictionary = new HashSet<>();

        for (int i = 0; i < n; i++) {
            String line = sc.nextLine();
            String[] parts = line.split(" ", 2);
            String command = parts[0];
            String str = parts[1];

            if (command.equals("insert")) {
                dictionary.add(str);
            } else if (command.equals("find")) {
                if (dictionary.contains(str)) {
                    System.out.println("yes");
                } else {
                    System.out.println("no");
                }
            }
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        scanner.nextLine();

        Set<String> dictionary = new HashSet<>();

        for (int i = 0; i < n; i++) {
            String line = scanner.nextLine();
            String[] parts = line.split(" ", 2);
            String command = parts[0];
            String str = parts[1];

            if (command.equals("insert")) {
                dictionary.add(str);
            } else if (command.equals("find")) {
                if (dictionary.contains(str)) {
                    System.out.println("yes");
                } else {
                    System.out.println("no");
                }
            }
        }

        scanner.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        sc.nextLine();

        Set<String> dictionary = new HashSet<>();

        for (int i = 0; i < n; i++) {
            String line = sc.nextLine();
            String[] parts = line.split(" ", 2);
            String command = parts[0];
            String str = parts[1];

            if (command.equals("insert")) {
                dictionary.add(str);
            } else if (command.equals("find")) {
                if (dictionary.contains(str)) {
                    System.out.println("yes");
                } else {
                    System.out.println("no");
                }
            }
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int k = sc.nextInt();
        int[] weights = new int[n];

        int maxWeight = 0;
        int totalWeight = 0;
        for (int i = 0; i < n; i++) {
            weights[i] = sc.nextInt();
            maxWeight = Math.max(maxWeight, weights[i]);
            totalWeight += weights[i];
        }

        int left = maxWeight;
        int right = totalWeight;
        int result = right;

        while (left <= right) {
            int mid = left + (right - left) / 2;
            if (canLoad(weights, k, mid)) {
                result = mid;
                right = mid - 1;
            } else {
                left = mid + 1;
            }
        }

        System.out.println(result);
    }

    private static boolean canLoad(int[] weights, int k, int maxLoad) {
        int trucks = 1;
        int currentLoad = 0;

        for (int weight : weights) {
            if (currentLoad + weight <= maxLoad) {
                currentLoad += weight;
            } else {
                trucks++;
                currentLoad = weight;
                if (trucks > k) {
                    return false;
                }
            }
        }

        return true;
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int k = sc.nextInt();
        int[] weights = new int[n];

        int maxWeight = 0;
        int totalWeight = 0;
        for (int i = 0; i < n; i++) {
            weights[i] = sc.nextInt();
            maxWeight = Math.max(maxWeight, weights[i]);
            totalWeight += weights[i];
        }

        int left = maxWeight;
        int right = totalWeight;
        int result = right;

        while (left <= right) {
            int mid = left + (right - left) / 2;
            if (canLoadWithCapacity(weights, k, mid)) {
                result = mid;
                right = mid - 1;
            } else {
                left = mid + 1;
            }
        }

        System.out.println(result);
    }

    private static boolean canLoadWithCapacity(int[] weights, int k, int capacity) {
        int trucksUsed = 1;
        int currentLoad = 0;

        for (int weight : weights) {
            if (currentLoad + weight <= capacity) {
                currentLoad += weight;
            } else {
                trucksUsed++;
                currentLoad = weight;
                if (trucksUsed > k) {
                    return false;
                }
            }
        }

        return true;
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int k = sc.nextInt();
        int[] weights = new int[n];

        int maxWeight = 0;
        int totalWeight = 0;
        for (int i = 0; i < n; i++) {
            weights[i] = sc.nextInt();
            maxWeight = Math.max(maxWeight, weights[i]);
            totalWeight += weights[i];
        }

        int left = maxWeight;
        int right = totalWeight;
        int result = right;

        while (left <= right) {
            int mid = left + (right - left) / 2;
            if (canLoad(weights, k, mid)) {
                result = mid;
                right = mid - 1;
            } else {
                left = mid + 1;
            }
        }

        System.out.println(result);
    }

    private static boolean canLoad(int[] weights, int k, int maxLoad) {
        int trucks = 1;
        int currentLoad = 0;

        for (int weight : weights) {
            if (currentLoad + weight <= maxLoad) {
                currentLoad += weight;
            } else {
                trucks++;
                currentLoad = weight;
                if (trucks > k) {
                    return false;
                }
            }
        }

        return true;
    }
}

import java.util.*;

public class Main {
    static int[] A;
    static int n;

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        n = sc.nextInt();
        A = new int[n];
        for (int i = 0; i < n; i++) {
            A[i] = sc.nextInt();
        }

        int q = sc.nextInt();
        for (int i = 0; i < q; i++) {
            int M = sc.nextInt();
            if (solve(0, M)) {
                System.out.println("yes");
            } else {
                System.out.println("no");
            }
        }
    }

    static boolean solve(int p, int t) {
        if (t == 0) return true;
        if (p >= n) return false;

        return solve(p + 1, t) || solve(p + 1, t - A[p]);
    }
}

import java.util.*;

public class Main {
    static int[] A;
    static int n;

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        n = sc.nextInt();
        A = new int[n];
        for (int i = 0; i < n; i++) {
            A[i] = sc.nextInt();
        }

        int q = sc.nextInt();
        for (int i = 0; i < q; i++) {
            int M = sc.nextInt();
            if (solve(0, M)) {
                System.out.println("yes");
            } else {
                System.out.println("no");
            }
        }
    }

    static boolean solve(int p, int t) {
        if (t == 0) return true;
        if (p >= n) return false;

        return solve(p + 1, t) || solve(p + 1, t - A[p]);
    }
}

import java.util.Scanner;

public class Main {
    private static long inversions = 0;

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] arr = new int[n];

        for (int i = 0; i < n; i++) {
            arr[i] = sc.nextInt();
        }

        mergeSort(arr, 0, n - 1);
        System.out.println(inversions);
    }

    private static void mergeSort(int[] arr, int left, int right) {
        if (left < right) {
            int mid = left + (right - left) / 2;
            mergeSort(arr, left, mid);
            mergeSort(arr, mid + 1, right);
            merge(arr, left, mid, right);
        }
    }

    private static void merge(int[] arr, int left, int mid, int right) {
        int[] temp = new int[right - left + 1];
        int i = left, j = mid + 1, k = 0;

        while (i <= mid && j <= right) {
            if (arr[i] <= arr[j]) {
                temp[k++] = arr[i++];
            } else {
                temp[k++] = arr[j++];
                inversions += (mid - i + 1);
            }
        }

        while (i <= mid) {
            temp[k++] = arr[i++];
        }

        while (j <= right) {
            temp[k++] = arr[j++];
        }

        for (i = left; i <= right; i++) {
            arr[i] = temp[i - left];
        }
    }
}

import java.util.Scanner;

public class Main {
    private static long inversions = 0;

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] arr = new int[n];

        for (int i = 0; i < n; i++) {
            arr[i] = sc.nextInt();
        }

        mergeSort(arr, 0, n - 1);
        System.out.println(inversions);
    }

    private static void mergeSort(int[] arr, int left, int right) {
        if (left < right) {
            int mid = left + (right - left) / 2;
            mergeSort(arr, left, mid);
            mergeSort(arr, mid + 1, right);
            merge(arr, left, mid, right);
        }
    }

    private static void merge(int[] arr, int left, int mid, int right) {
        int[] temp = new int[right - left + 1];
        int i = left, j = mid + 1, k = 0;

        while (i <= mid && j <= right) {
            if (arr[i] <= arr[j]) {
                temp[k++] = arr[i++];
            } else {
                temp[k++] = arr[j++];
                inversions += (mid - i + 1);
            }
        }

        while (i <= mid) {
            temp[k++] = arr[i++];
        }

        while (j <= right) {
            temp[k++] = arr[j++];
        }

        for (i = left; i <= right; i++) {
            arr[i] = temp[i - left];
        }
    }
}

import java.util.Scanner;

public class Main {
    private static long mergeAndCount(int[] arr, int[] temp, int left, int mid, int right) {
        int i = left, j = mid + 1, k = left;
        long invCount = 0;

        while (i <= mid && j <= right) {
            if (arr[i] <= arr[j]) {
                temp[k++] = arr[i++];
            } else {
                temp[k++] = arr[j++];
                invCount += (mid - i + 1);
            }
        }

        while (i <= mid) {
            temp[k++] = arr[i++];
        }

        while (j <= right) {
            temp[k++] = arr[j++];
        }

        for (i = left; i <= right; i++) {
            arr[i] = temp[i];
        }

        return invCount;
    }

    private static long mergeSortAndCount(int[] arr, int[] temp, int left, int right) {
        long invCount = 0;
        if (left < right) {
            int mid = left + (right - left) / 2;

            invCount += mergeSortAndCount(arr, temp, left, mid);
            invCount += mergeSortAndCount(arr, temp, mid + 1, right);
            invCount += mergeAndCount(arr, temp, left, mid, right);
        }
        return invCount;
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] arr = new int[n];
        int[] temp = new int[n];

        for (int i = 0; i < n; i++) {
            arr[i] = sc.nextInt();
        }

        long result = mergeSortAndCount(arr, temp, 0, n - 1);
        System.out.println(result);

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    private static long mergeAndCount(int[] arr, int[] temp, int left, int mid, int right) {
        int i = left, j = mid + 1, k = left;
        long invCount = 0;

        while (i <= mid && j <= right) {
            if (arr[i] <= arr[j]) {
                temp[k++] = arr[i++];
            } else {
                temp[k++] = arr[j++];
                invCount += (mid - i + 1);
            }
        }

        while (i <= mid) {
            temp[k++] = arr[i++];
        }

        while (j <= right) {
            temp[k++] = arr[j++];
        }

        for (i = left; i <= right; i++) {
            arr[i] = temp[i];
        }

        return invCount;
    }

    private static long mergeSortAndCount(int[] arr, int[] temp, int left, int right) {
        long invCount = 0;
        if (left < right) {
            int mid = left + (right - left) / 2;

            invCount += mergeSortAndCount(arr, temp, left, mid);
            invCount += mergeSortAndCount(arr, temp, mid + 1, right);
            invCount += mergeAndCount(arr, temp, left, mid, right);
        }
        return invCount;
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] arr = new int[n];
        int[] temp = new int[n];

        for (int i = 0; i < n; i++) {
            arr[i] = sc.nextInt();
        }

        long result = mergeSortAndCount(arr, temp, 0, n - 1);
        System.out.println(result);

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] A = new int[n];
        int maxVal = 0;

        for (int i = 0; i < n; i++) {
            A[i] = sc.nextInt();
            maxVal = Math.max(maxVal, A[i]);
        }

        int[] C = new int[maxVal + 1];
        int[] B = new int[n];

        for (int j = 0; j < n; j++) {
            C[A[j]]++;
        }

        for (int i = 1; i <= maxVal; i++) {
            C[i] = C[i] + C[i - 1];
        }

        for (int j = n - 1; j >= 0; j--) {
            B[C[A[j]] - 1] = A[j];
            C[A[j]]--;
        }

        for (int i = 0; i < n; i++) {
            if (i > 0) System.out.print(" ");
            System.out.print(B[i]);
        }
        System.out.println();

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] A = new int[n];
        int maxVal = 0;

        for (int i = 0; i < n; i++) {
            A[i] = sc.nextInt();
            maxVal = Math.max(maxVal, A[i]);
        }

        int[] C = new int[maxVal + 1];
        int[] B = new int[n];

        for (int j = 0; j < n; j++) {
            C[A[j]]++;
        }

        for (int i = 1; i <= maxVal; i++) {
            C[i] = C[i] + C[i - 1];
        }

        for (int j = n - 1; j >= 0; j--) {
            B[C[A[j]] - 1] = A[j];
            C[A[j]]--;
        }

        for (int i = 0; i < n; i++) {
            if (i > 0) System.out.print(" ");
            System.out.print(B[i]);
        }
        System.out.println();

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] A = new int[n];

        for (int i = 0; i < n; i++) {
            A[i] = sc.nextInt();
        }

        int pivotIndex = partition(A, 0, n - 1);

        for (int i = 0; i < n; i++) {
            if (i == pivotIndex) {
                System.out.print("[" + A[i] + "]");
            } else {
                System.out.print(A[i]);
            }
            if (i < n - 1) {
                System.out.print(" ");
            }
        }
        System.out.println();
    }

    static int partition(int[] A, int p, int r) {
        int x = A[r];
        int i = p - 1;

        for (int j = p; j <= r - 1; j++) {
            if (A[j] <= x) {
                i++;
                int temp = A[i];
                A[i] = A[j];
                A[j] = temp;
            }
        }

        int temp = A[i + 1];
        A[i + 1] = A[r];
        A[r] = temp;

        return i + 1;
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] A = new int[n];

        for (int i = 0; i < n; i++) {
            A[i] = sc.nextInt();
        }

        int pivotIndex = partition(A, 0, n - 1);

        for (int i = 0; i < n; i++) {
            if (i == pivotIndex) {
                System.out.print("[" + A[i] + "]");
            } else {
                System.out.print(A[i]);
            }
            if (i < n - 1) {
                System.out.print(" ");
            }
        }
        System.out.println();
    }

    static int partition(int[] A, int p, int r) {
        int x = A[r];
        int i = p - 1;

        for (int j = p; j <= r - 1; j++) {
            if (A[j] <= x) {
                i++;
                int temp = A[i];
                A[i] = A[j];
                A[j] = temp;
            }
        }

        int temp = A[i + 1];
        A[i + 1] = A[r];
        A[r] = temp;

        return i + 1;
    }
}

import java.util.*;

public class Main {
    static class Node {
        int id;
        Node left, right;

        Node(int id) {
            this.id = id;
        }
    }

    static List<Integer> preorder = new ArrayList<>();
    static List<Integer> inorder = new ArrayList<>();
    static List<Integer> postorder = new ArrayList<>();

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        Node[] nodes = new Node[n];
        boolean[] hasParent = new boolean[n];

        for (int i = 0; i < n; i++) {
            nodes[i] = new Node(i);
        }

        for (int i = 0; i < n; i++) {
            int id = sc.nextInt();
            int left = sc.nextInt();
            int right = sc.nextInt();

            if (left != -1) {
                nodes[id].left = nodes[left];
                hasParent[left] = true;
            }
            if (right != -1) {
                nodes[id].right = nodes[right];
                hasParent[right] = true;
            }
        }

        Node root = null;
        for (int i = 0; i < n; i++) {
            if (!hasParent[i]) {
                root = nodes[i];
                break;
            }
        }

        preorderIterative(root);
        inorderIterative(root);
        postorderIterative(root);

        System.out.println("Preorder");
        for (int id : preorder) {
            System.out.print(" " + id);
        }
        System.out.println();

        System.out.println("Inorder");
        for (int id : inorder) {
            System.out.print(" " + id);
        }
        System.out.println();

        System.out.println("Postorder");
        for (int id : postorder) {
            System.out.print(" " + id);
        }
        System.out.println();
    }

    static void preorderIterative(Node root) {
        if (root == null) return;
        Stack<Node> stack = new Stack<>();
        stack.push(root);

        while (!stack.isEmpty()) {
            Node node = stack.pop();
            preorder.add(node.id);

            if (node.right != null) stack.push(node.right);
            if (node.left != null) stack.push(node.left);
        }
    }

    static void inorderIterative(Node root) {
        Stack<Node> stack = new Stack<>();
        Node current = root;

        while (current != null || !stack.isEmpty()) {
            while (current != null) {
                stack.push(current);
                current = current.left;
            }
            current = stack.pop();
            inorder.add(current.id);
            current = current.right;
        }
    }

    static void postorderIterative(Node root) {
        if (root == null) return;
        Stack<Node> stack1 = new Stack<>();
        Stack<Node> stack2 = new Stack<>();
        stack1.push(root);

        while (!stack1.isEmpty()) {
            Node node = stack1.pop();
            stack2.push(node);

            if (node.left != null) stack1.push(node.left);
            if (node.right != null) stack1.push(node.right);
        }

        while (!stack2.isEmpty()) {
            postorder.add(stack2.pop().id);
        }
    }
}

import java.util.*;

public class Main {
    static class Node {
        int id;
        Node left, right;

        Node(int id) {
            this.id = id;
        }
    }

    static List<Integer> preorder = new ArrayList<>();
    static List<Integer> inorder = new ArrayList<>();
    static List<Integer> postorder = new ArrayList<>();

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        Node[] nodes = new Node[n];
        boolean[] hasParent = new boolean[n];

        for (int i = 0; i < n; i++) {
            nodes[i] = new Node(i);
        }

        for (int i = 0; i < n; i++) {
            int id = sc.nextInt();
            int left = sc.nextInt();
            int right = sc.nextInt();

            if (left != -1) {
                nodes[id].left = nodes[left];
                hasParent[left] = true;
            }
            if (right != -1) {
                nodes[id].right = nodes[right];
                hasParent[right] = true;
            }
        }

        Node root = null;
        for (int i = 0; i < n; i++) {
            if (!hasParent[i]) {
                root = nodes[i];
                break;
            }
        }

        preorderIterative(root);
        inorderIterative(root);
        postorderIterative(root);

        System.out.println("Preorder");
        for (int id : preorder) {
            System.out.print(" " + id);
        }
        System.out.println();

        System.out.println("Inorder");
        for (int id : inorder) {
            System.out.print(" " + id);
        }
        System.out.println();

        System.out.println("Postorder");
        for (int id : postorder) {
            System.out.print(" " + id);
        }
        System.out.println();
    }

    static void preorderIterative(Node root) {
        if (root == null) return;
        Stack<Node> stack = new Stack<>();
        stack.push(root);

        while (!stack.isEmpty()) {
            Node current = stack.pop();
            preorder.add(current.id);

            if (current.right != null) stack.push(current.right);
            if (current.left != null) stack.push(current.left);
        }
    }

    static void inorderIterative(Node root) {
        Stack<Node> stack = new Stack<>();
        Node current = root;

        while (current != null || !stack.isEmpty()) {
            while (current != null) {
                stack.push(current);
                current = current.left;
            }
            current = stack.pop();
            inorder.add(current.id);
            current = current.right;
        }
    }

    static void postorderIterative(Node root) {
        if (root == null) return;
        Stack<Node> stack1 = new Stack<>();
        Stack<Node> stack2 = new Stack<>();

        stack1.push(root);
        while (!stack1.isEmpty()) {
            Node current = stack1.pop();
            stack2.push(current);

            if (current.left != null) stack1.push(current.left);
            if (current.right != null) stack1.push(current.right);
        }

        while (!stack2.isEmpty()) {
            postorder.add(stack2.pop().id);
        }
    }
}

import java.util.*;

public class Main {
    static class TreeNode {
        int val;
        TreeNode left;
        TreeNode right;

        TreeNode(int val) {
            this.val = val;
        }
    }

    static Map<Integer, Integer> inorderMap;
    static int preorderIndex;

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        int[] preorder = new int[n];
        int[] inorder = new int[n];

        for (int i = 0; i < n; i++) {
            preorder[i] = sc.nextInt();
        }

        for (int i = 0; i < n; i++) {
            inorder[i] = sc.nextInt();
        }

        inorderMap = new HashMap<>();
        for (int i = 0; i < n; i++) {
            inorderMap.put(inorder[i], i);
        }

        preorderIndex = 0;
        TreeNode root = buildTree(preorder, 0, n - 1);

        List<Integer> postorder = new ArrayList<>();
        postorderTraversal(root, postorder);

        for (int i = 0; i < postorder.size(); i++) {
            if (i > 0) System.out.print(" ");
            System.out.print(postorder.get(i));
        }
        System.out.println();
    }

    static TreeNode buildTree(int[] preorder, int inStart, int inEnd) {
        if (inStart > inEnd) return null;

        int rootVal = preorder[preorderIndex++];
        TreeNode root = new TreeNode(rootVal);

        int inIndex = inorderMap.get(rootVal);

        root.left = buildTree(preorder, inStart, inIndex - 1);
        root.right = buildTree(preorder, inIndex + 1, inEnd);

        return root;
    }

    static void postorderTraversal(TreeNode node, List<Integer> result) {
        if (node == null) return;

        postorderTraversal(node.left, result);
        postorderTraversal(node.right, result);
        result.add(node.val);
    }
}

import java.util.*;

public class Main {
    static class TreeNode {
        int val;
        TreeNode left;
        TreeNode right;

        TreeNode(int val) {
            this.val = val;
        }
    }

    static Map<Integer, Integer> inorderMap;
    static int preorderIndex;

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        int[] preorder = new int[n];
        int[] inorder = new int[n];

        for (int i = 0; i < n; i++) {
            preorder[i] = sc.nextInt();
        }

        for (int i = 0; i < n; i++) {
            inorder[i] = sc.nextInt();
        }

        inorderMap = new HashMap<>();
        for (int i = 0; i < n; i++) {
            inorderMap.put(inorder[i], i);
        }

        preorderIndex = 0;
        TreeNode root = buildTree(preorder, 0, n - 1);

        List<Integer> postorder = new ArrayList<>();
        postorderTraversal(root, postorder);

        for (int i = 0; i < postorder.size(); i++) {
            if (i > 0) System.out.print(" ");
            System.out.print(postorder.get(i));
        }
        System.out.println();
    }

    static TreeNode buildTree(int[] preorder, int inStart, int inEnd) {
        if (inStart > inEnd) return null;

        int rootVal = preorder[preorderIndex++];
        TreeNode root = new TreeNode(rootVal);

        int inIndex = inorderMap.get(rootVal);

        root.left = buildTree(preorder, inStart, inIndex - 1);
        root.right = buildTree(preorder, inIndex + 1, inEnd);

        return root;
    }

    static void postorderTraversal(TreeNode node, List<Integer> result) {
        if (node == null) return;

        postorderTraversal(node.left, result);
        postorderTraversal(node.right, result);
        result.add(node.val);
    }
}

import java.util.*;

class Node {
    int key;
    Node left, right, parent;

    Node(int key) {
        this.key = key;
        this.left = null;
        this.right = null;
        this.parent = null;
    }
}

class BinarySearchTree {
    Node root;

    BinarySearchTree() {
        this.root = null;
    }

    void insert(int key) {
        Node z = new Node(key);
        Node y = null;
        Node x = root;

        while (x != null) {
            y = x;
            if (z.key < x.key) {
                x = x.left;
            } else {
                x = x.right;
            }
        }

        z.parent = y;

        if (y == null) {
            root = z;
        } else if (z.key < y.key) {
            y.left = z;
        } else {
            y.right = z;
        }
    }

    void inorderWalk(Node node, List<Integer> result) {
        if (node != null) {
            inorderWalk(node.left, result);
            result.add(node.key);
            inorderWalk(node.right, result);
        }
    }

    void preorderWalk(Node node, List<Integer> result) {
        if (node != null) {
            result.add(node.key);
            preorderWalk(node.left, result);
            preorderWalk(node.right, result);
        }
    }

    void print() {
        List<Integer> inorder = new ArrayList<>();
        List<Integer> preorder = new ArrayList<>();

        inorderWalk(root, inorder);
        preorderWalk(root, preorder);

        for (int key : inorder) {
            System.out.print(" " + key);
        }
        System.out.println();

        for (int key : preorder) {
            System.out.print(" " + key);
        }
        System.out.println();
    }
}

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int m = scanner.nextInt();
        BinarySearchTree bst = new BinarySearchTree();

        for (int i = 0; i < m; i++) {
            String operation = scanner.next();
            if (operation.equals("insert")) {
                int key = scanner.nextInt();
                bst.insert(key);
            } else if (operation.equals("print")) {
                bst.print();
            }
        }

        scanner.close();
    }
}

import java.util.*;

class Node {
    int key;
    Node left, right, parent;

    Node(int key) {
        this.key = key;
        this.left = null;
        this.right = null;
        this.parent = null;
    }
}

class BinarySearchTree {
    Node root;

    BinarySearchTree() {
        this.root = null;
    }

    void insert(int key) {
        Node z = new Node(key);
        Node y = null;
        Node x = root;

        while (x != null) {
            y = x;
            if (z.key < x.key) {
                x = x.left;
            } else {
                x = x.right;
            }
        }

        z.parent = y;

        if (y == null) {
            root = z;
        } else if (z.key < y.key) {
            y.left = z;
        } else {
            y.right = z;
        }
    }

    void inorder(Node node, List<Integer> result) {
        if (node != null) {
            inorder(node.left, result);
            result.add(node.key);
            inorder(node.right, result);
        }
    }

    void preorder(Node node, List<Integer> result) {
        if (node != null) {
            result.add(node.key);
            preorder(node.left, result);
            preorder(node.right, result);
        }
    }

    void print() {
        List<Integer> inorderResult = new ArrayList<>();
        List<Integer> preorderResult = new ArrayList<>();

        inorder(root, inorderResult);
        preorder(root, preorderResult);

        for (int key : inorderResult) {
            System.out.print(" " + key);
        }
        System.out.println();

        for (int key : preorderResult) {
            System.out.print(" " + key);
        }
        System.out.println();
    }
}

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int m = scanner.nextInt();

        BinarySearchTree bst = new BinarySearchTree();

        for (int i = 0; i < m; i++) {
            String operation = scanner.next();

            if (operation.equals("insert")) {
                int key = scanner.nextInt();
                bst.insert(key);
            } else if (operation.equals("print")) {
                bst.print();
            }
        }

        scanner.close();
    }
}

import java.util.*;

public class Main {
    static class Node {
        int key;
        Node left, right;

        Node(int key) {
            this.key = key;
        }
    }

    static class BST {
        Node root;

        void insert(int key) {
            root = insertRec(root, key);
        }

        Node insertRec(Node node, int key) {
            if (node == null) {
                return new Node(key);
            }

            if (key < node.key) {
                node.left = insertRec(node.left, key);
            } else if (key > node.key) {
                node.right = insertRec(node.right, key);
            }

            return node;
        }

        boolean find(int key) {
            return findRec(root, key);
        }

        boolean findRec(Node node, int key) {
            if (node == null) {
                return false;
            }

            if (key == node.key) {
                return true;
            } else if (key < node.key) {
                return findRec(node.left, key);
            } else {
                return findRec(node.right, key);
            }
        }

        void inorder() {
            inorderRec(root);
            System.out.println();
        }

        void inorderRec(Node node) {
            if (node != null) {
                inorderRec(node.left);
                System.out.print(" " + node.key);
                inorderRec(node.right);
            }
        }

        void preorder() {
            preorderRec(root);
            System.out.println();
        }

        void preorderRec(Node node) {
            if (node != null) {
                System.out.print(" " + node.key);
                preorderRec(node.left);
                preorderRec(node.right);
            }
        }
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        BST bst = new BST();

        int m = sc.nextInt();

        for (int i = 0; i < m; i++) {
            String operation = sc.next();

            if (operation.equals("insert")) {
                int k = sc.nextInt();
                bst.insert(k);
            } else if (operation.equals("find")) {
                int k = sc.nextInt();
                if (bst.find(k)) {
                    System.out.println("yes");
                } else {
                    System.out.println("no");
                }
            } else if (operation.equals("print")) {
                bst.inorder();
                bst.preorder();
            }
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    static class Node {
        int key;
        Node left, right;

        Node(int key) {
            this.key = key;
        }
    }

    static class BST {
        Node root;

        void insert(int key) {
            root = insertRec(root, key);
        }

        Node insertRec(Node node, int key) {
            if (node == null) {
                return new Node(key);
            }

            if (key < node.key) {
                node.left = insertRec(node.left, key);
            } else if (key > node.key) {
                node.right = insertRec(node.right, key);
            }

            return node;
        }

        boolean find(int key) {
            return findRec(root, key);
        }

        boolean findRec(Node node, int key) {
            if (node == null) {
                return false;
            }

            if (key == node.key) {
                return true;
            } else if (key < node.key) {
                return findRec(node.left, key);
            } else {
                return findRec(node.right, key);
            }
        }

        void printInorder() {
            inorderRec(root);
            System.out.println();
        }

        void inorderRec(Node node) {
            if (node != null) {
                inorderRec(node.left);
                System.out.print(" " + node.key);
                inorderRec(node.right);
            }
        }

        void printPreorder() {
            preorderRec(root);
            System.out.println();
        }

        void preorderRec(Node node) {
            if (node != null) {
                System.out.print(" " + node.key);
                preorderRec(node.left);
                preorderRec(node.right);
            }
        }
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        BST bst = new BST();
        int m = sc.nextInt();

        for (int i = 0; i < m; i++) {
            String operation = sc.next();

            if (operation.equals("insert")) {
                int key = sc.nextInt();
                bst.insert(key);
            } else if (operation.equals("find")) {
                int key = sc.nextInt();
                if (bst.find(key)) {
                    System.out.println("yes");
                } else {
                    System.out.println("no");
                }
            } else if (operation.equals("print")) {
                bst.printInorder();
                bst.printPreorder();
            }
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    static class Node {
        int key, priority;
        Node left, right;

        Node(int key, int priority) {
            this.key = key;
            this.priority = priority;
            this.left = null;
            this.right = null;
        }
    }

    static class Treap {
        Node root;

        Treap() {
            root = null;
        }

        Node rightRotate(Node t) {
            Node s = t.left;
            t.left = s.right;
            s.right = t;
            return s;
        }

        Node leftRotate(Node t) {
            Node s = t.right;
            t.right = s.left;
            s.left = t;
            return s;
        }

        Node insert(Node t, int key, int priority) {
            if (t == null) {
                return new Node(key, priority);
            }
            if (key == t.key) {
                return t;
            }

            if (key < t.key) {
                t.left = insert(t.left, key, priority);
                if (t.priority < t.left.priority) {
                    t = rightRotate(t);
                }
            } else {
                t.right = insert(t.right, key, priority);
                if (t.priority < t.right.priority) {
                    t = leftRotate(t);
                }
            }
            return t;
        }

        Node delete(Node t, int key) {
            if (t == null) {
                return null;
            }
            if (key < t.key) {
                t.left = delete(t.left, key);
            } else if (key > t.key) {
                t.right = delete(t.right, key);
            } else {
                return _delete(t, key);
            }
            return t;
        }

        Node _delete(Node t, int key) {
            if (t.left == null && t.right == null) {
                return null;
            } else if (t.left == null) {
                t = leftRotate(t);
            } else if (t.right == null) {
                t = rightRotate(t);
            } else {
                if (t.left.priority > t.right.priority) {
                    t = rightRotate(t);
                } else {
                    t = leftRotate(t);
                }
            }
            return delete(t, key);
        }

        boolean find(Node t, int key) {
            if (t == null) {
                return false;
            }
            if (key == t.key) {
                return true;
            } else if (key < t.key) {
                return find(t.left, key);
            } else {
                return find(t.right, key);
            }
        }

        void inorder(Node t, List<Integer> result) {
            if (t != null) {
                inorder(t.left, result);
                result.add(t.key);
                inorder(t.right, result);
            }
        }

        void preorder(Node t, List<Integer> result) {
            if (t != null) {
                result.add(t.key);
                preorder(t.left, result);
                preorder(t.right, result);
            }
        }

        void insert(int key, int priority) {
            root = insert(root, key, priority);
        }

        void delete(int key) {
            root = delete(root, key);
        }

        boolean find(int key) {
            return find(root, key);
        }

        void print() {
            List<Integer> inorderResult = new ArrayList<>();
            List<Integer> preorderResult = new ArrayList<>();

            inorder(root, inorderResult);
            preorder(root, preorderResult);

            for (int key : inorderResult) {
                System.out.print(" " + key);
            }
            System.out.println();

            for (int key : preorderResult) {
                System.out.print(" " + key);
            }
            System.out.println();
        }
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int m = sc.nextInt();
        Treap treap = new Treap();

        for (int i = 0; i < m; i++) {
            String operation = sc.next();

            if (operation.equals("insert")) {
                int k = sc.nextInt();
                int p = sc.nextInt();
                treap.insert(k, p);
            } else if (operation.equals("find")) {
                int k = sc.nextInt();
                if (treap.find(k)) {
                    System.out.println("yes");
                } else {
                    System.out.println("no");
                }
            } else if (operation.equals("delete")) {
                int k = sc.nextInt();
                treap.delete(k);
            } else if (operation.equals("print")) {
                treap.print();
            }
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    static class Node {
        int key, priority;
        Node left, right;

        Node(int key, int priority) {
            this.key = key;
            this.priority = priority;
            this.left = null;
            this.right = null;
        }
    }

    static class Treap {
        Node root;

        Treap() {
            root = null;
        }

        Node rightRotate(Node t) {
            Node s = t.left;
            t.left = s.right;
            s.right = t;
            return s;
        }

        Node leftRotate(Node t) {
            Node s = t.right;
            t.right = s.left;
            s.left = t;
            return s;
        }

        Node insert(Node t, int key, int priority) {
            if (t == null) {
                return new Node(key, priority);
            }
            if (key == t.key) {
                return t;
            }

            if (key < t.key) {
                t.left = insert(t.left, key, priority);
                if (t.priority < t.left.priority) {
                    t = rightRotate(t);
                }
            } else {
                t.right = insert(t.right, key, priority);
                if (t.priority < t.right.priority) {
                    t = leftRotate(t);
                }
            }
            return t;
        }

        Node delete(Node t, int key) {
            if (t == null) {
                return null;
            }
            if (key < t.key) {
                t.left = delete(t.left, key);
            } else if (key > t.key) {
                t.right = delete(t.right, key);
            } else {
                return _delete(t, key);
            }
            return t;
        }

        Node _delete(Node t, int key) {
            if (t.left == null && t.right == null) {
                return null;
            } else if (t.left == null) {
                t = leftRotate(t);
            } else if (t.right == null) {
                t = rightRotate(t);
            } else {
                if (t.left.priority > t.right.priority) {
                    t = rightRotate(t);
                } else {
                    t = leftRotate(t);
                }
            }
            return delete(t, key);
        }

        boolean find(Node t, int key) {
            if (t == null) {
                return false;
            }
            if (key == t.key) {
                return true;
            } else if (key < t.key) {
                return find(t.left, key);
            } else {
                return find(t.right, key);
            }
        }

        void inorder(Node t, List<Integer> result) {
            if (t != null) {
                inorder(t.left, result);
                result.add(t.key);
                inorder(t.right, result);
            }
        }

        void preorder(Node t, List<Integer> result) {
            if (t != null) {
                result.add(t.key);
                preorder(t.left, result);
                preorder(t.right, result);
            }
        }

        void insert(int key, int priority) {
            root = insert(root, key, priority);
        }

        void delete(int key) {
            root = delete(root, key);
        }

        boolean find(int key) {
            return find(root, key);
        }

        void print() {
            List<Integer> inorderResult = new ArrayList<>();
            List<Integer> preorderResult = new ArrayList<>();

            inorder(root, inorderResult);
            preorder(root, preorderResult);

            for (int key : inorderResult) {
                System.out.print(" " + key);
            }
            System.out.println();

            for (int key : preorderResult) {
                System.out.print(" " + key);
            }
            System.out.println();
        }
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int m = sc.nextInt();
        Treap treap = new Treap();

        for (int i = 0; i < m; i++) {
            String operation = sc.next();

            if (operation.equals("insert")) {
                int k = sc.nextInt();
                int p = sc.nextInt();
                treap.insert(k, p);
            } else if (operation.equals("find")) {
                int k = sc.nextInt();
                if (treap.find(k)) {
                    System.out.println("yes");
                } else {
                    System.out.println("no");
                }
            } else if (operation.equals("delete")) {
                int k = sc.nextInt();
                treap.delete(k);
            } else if (operation.equals("print")) {
                treap.print();
            }
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int H = sc.nextInt();
        int[] heap = new int[H + 1];

        for (int i = 1; i <= H; i++) {
            heap[i] = sc.nextInt();
        }

        for (int i = 1; i <= H; i++) {
            System.out.print("node " + i + ": key = " + heap[i] + ", ");

            if (i > 1) {
                int parent = i / 2;
                System.out.print("parent key = " + heap[parent] + ", ");
            }

            int left = 2 * i;
            if (left <= H) {
                System.out.print("left key = " + heap[left] + ", ");
            }

            int right = 2 * i + 1;
            if (right <= H) {
                System.out.print("right key = " + heap[right] + ", ");
            }

            System.out.println();
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int H = sc.nextInt();
        int[] heap = new int[H + 1];

        for (int i = 1; i <= H; i++) {
            heap[i] = sc.nextInt();
        }

        for (int i = 1; i <= H; i++) {
            System.out.print("node " + i + ": key = " + heap[i] + ", ");

            if (i > 1) {
                int parent = i / 2;
                System.out.print("parent key = " + heap[parent] + ", ");
            }

            int left = 2 * i;
            if (left <= H) {
                System.out.print("left key = " + heap[left] + ", ");
            }

            int right = 2 * i + 1;
            if (right <= H) {
                System.out.print("right key = " + heap[right] + ", ");
            }

            System.out.println();
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int H = sc.nextInt();
        int[] heap = new int[H + 1];

        for (int i = 1; i <= H; i++) {
            heap[i] = sc.nextInt();
        }

        for (int i = 1; i <= H; i++) {
            System.out.print("node " + i + ": key = " + heap[i]);

            if (i > 1) {
                int parent = i / 2;
                System.out.print(", parent key = " + heap[parent]);
            }

            int left = 2 * i;
            if (left <= H) {
                System.out.print(", left key = " + heap[left]);
            }

            int right = 2 * i + 1;
            if (right <= H) {
                System.out.print(", right key = " + heap[right]);
            }

            System.out.println(", ");
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int H = scanner.nextInt();
        int[] heap = new int[H + 1];

        for (int i = 1; i <= H; i++) {
            heap[i] = scanner.nextInt();
        }

        for (int i = 1; i <= H; i++) {
            System.out.print("node " + i + ": key = " + heap[i]);

            if (i > 1) {
                int parent = i / 2;
                System.out.print(", parent key = " + heap[parent]);
            }

            int left = 2 * i;
            if (left <= H) {
                System.out.print(", left key = " + heap[left]);
            }

            int right = 2 * i + 1;
            if (right <= H) {
                System.out.print(", right key = " + heap[right]);
            }

            System.out.println(", ");
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    private static int[] A;
    private static int H;

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        H = sc.nextInt();
        A = new int[H + 1];

        for (int i = 1; i <= H; i++) {
            A[i] = sc.nextInt();
        }

        buildMaxHeap();

        for (int i = 1; i <= H; i++) {
            System.out.print(" " + A[i]);
        }
        System.out.println();
    }

    private static void buildMaxHeap() {
        for (int i = H / 2; i >= 1; i--) {
            maxHeapify(i);
        }
    }

    private static void maxHeapify(int i) {
        int l = 2 * i;
        int r = 2 * i + 1;
        int largest;

        if (l <= H && A[l] > A[i]) {
            largest = l;
        } else {
            largest = i;
        }

        if (r <= H && A[r] > A[largest]) {
            largest = r;
        }

        if (largest != i) {
            int temp = A[i];
            A[i] = A[largest];
            A[largest] = temp;
            maxHeapify(largest);
        }
    }
}

import java.util.Scanner;

public class Main {
    private static int[] heap;
    private static int H;

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        H = sc.nextInt();
        heap = new int[H + 1];

        for (int i = 1; i <= H; i++) {
            heap[i] = sc.nextInt();
        }

        buildMaxHeap();

        for (int i = 1; i <= H; i++) {
            System.out.print(" " + heap[i]);
        }
        System.out.println();
    }

    private static void buildMaxHeap() {
        for (int i = H / 2; i >= 1; i--) {
            maxHeapify(i);
        }
    }

    private static void maxHeapify(int i) {
        int l = 2 * i;
        int r = 2 * i + 1;
        int largest;

        if (l <= H && heap[l] > heap[i]) {
            largest = l;
        } else {
            largest = i;
        }

        if (r <= H && heap[r] > heap[largest]) {
            largest = r;
        }

        if (largest != i) {
            int temp = heap[i];
            heap[i] = heap[largest];
            heap[largest] = temp;

            maxHeapify(largest);
        }
    }
}

import java.util.Scanner;

public class Main {
    private static int[] A;
    private static int H;

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        H = sc.nextInt();
        A = new int[H + 1];

        for (int i = 1; i <= H; i++) {
            A[i] = sc.nextInt();
        }

        buildMaxHeap();

        for (int i = 1; i <= H; i++) {
            System.out.print(" " + A[i]);
        }
        System.out.println();
    }

    private static void buildMaxHeap() {
        for (int i = H / 2; i >= 1; i--) {
            maxHeapify(i);
        }
    }

    private static void maxHeapify(int i) {
        int l = 2 * i;
        int r = 2 * i + 1;
        int largest;

        if (l <= H && A[l] > A[i]) {
            largest = l;
        } else {
            largest = i;
        }

        if (r <= H && A[r] > A[largest]) {
            largest = r;
        }

        if (largest != i) {
            int temp = A[i];
            A[i] = A[largest];
            A[largest] = temp;

            maxHeapify(largest);
        }
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        PriorityQueue<Integer> pq = new PriorityQueue<>(Collections.reverseOrder());

        while (true) {
            String operation = sc.next();

            if (operation.equals("end")) {
                break;
            } else if (operation.equals("insert")) {
                int k = sc.nextInt();
                pq.offer(k);
            } else if (operation.equals("extract")) {
                System.out.println(pq.poll());
            }
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        PriorityQueue<Integer> pq = new PriorityQueue<>(Collections.reverseOrder());

        while (true) {
            String operation = scanner.next();

            if (operation.equals("end")) {
                break;
            } else if (operation.equals("insert")) {
                int k = scanner.nextInt();
                pq.add(k);
            } else if (operation.equals("extract")) {
                System.out.println(pq.poll());
            }
        }

        scanner.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        PriorityQueue<Integer> pq = new PriorityQueue<>(Collections.reverseOrder());

        while (true) {
            String operation = sc.next();

            if (operation.equals("end")) {
                break;
            } else if (operation.equals("insert")) {
                int k = sc.nextInt();
                pq.offer(k);
            } else if (operation.equals("extract")) {
                System.out.println(pq.poll());
            }
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        PriorityQueue<Integer> pq = new PriorityQueue<>(Collections.reverseOrder());

        while (true) {
            String operation = sc.next();

            if (operation.equals("end")) {
                break;
            } else if (operation.equals("insert")) {
                int k = sc.nextInt();
                pq.offer(k);
            } else if (operation.equals("extract")) {
                System.out.println(pq.poll());
            }
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        PriorityQueue<Integer> pq = new PriorityQueue<>(Collections.reverseOrder());

        while (true) {
            String operation = sc.next();

            if (operation.equals("end")) {
                break;
            } else if (operation.equals("insert")) {
                int k = sc.nextInt();
                pq.offer(k);
            } else if (operation.equals("extract")) {
                System.out.println(pq.poll());
            }
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        double x1 = sc.nextDouble();
        double y1 = sc.nextDouble();
        double x2 = sc.nextDouble();
        double y2 = sc.nextDouble();

        int q = sc.nextInt();

        for (int i = 0; i < q; i++) {
            double px = sc.nextDouble();
            double py = sc.nextDouble();

            double vx = x2 - x1;
            double vy = y2 - y1;

            double wx = px - x1;
            double wy = py - y1;

            double dot = wx * vx + wy * vy;

            double lenSq = vx * vx + vy * vy;

            double t = dot / lenSq;

            double projX = x1 + t * vx;
            double projY = y1 + t * vy;

            System.out.printf("%.10f %.10f%n", projX, projY);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        double x1 = sc.nextDouble();
        double y1 = sc.nextDouble();
        double x2 = sc.nextDouble();
        double y2 = sc.nextDouble();

        int q = sc.nextInt();

        for (int i = 0; i < q; i++) {
            double px = sc.nextDouble();
            double py = sc.nextDouble();

            double dx = x2 - x1;
            double dy = y2 - y1;

            double dpx = px - x1;
            double dpy = py - y1;

            double dot = dpx * dx + dpy * dy;
            double len2 = dx * dx + dy * dy;
            double t = dot / len2;

            double projX = x1 + t * dx;
            double projY = y1 + t * dy;

            System.out.printf("%.10f %.10f\n", projX, projY);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        double x1 = sc.nextDouble();
        double y1 = sc.nextDouble();
        double x2 = sc.nextDouble();
        double y2 = sc.nextDouble();

        int q = sc.nextInt();

        for (int i = 0; i < q; i++) {
            double px = sc.nextDouble();
            double py = sc.nextDouble();

            double dx = x2 - x1;
            double dy = y2 - y1;

            double dpx = px - x1;
            double dpy = py - y1;

            double dotProduct = dpx * dx + dpy * dy;
            double lengthSquared = dx * dx + dy * dy;
            double t = dotProduct / lengthSquared;

            double projX = x1 + t * dx;
            double projY = y1 + t * dy;

            System.out.printf("%.10f %.10f%n", projX, projY);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        double x1 = sc.nextDouble();
        double y1 = sc.nextDouble();
        double x2 = sc.nextDouble();
        double y2 = sc.nextDouble();

        int q = sc.nextInt();

        for (int i = 0; i < q; i++) {
            double px = sc.nextDouble();
            double py = sc.nextDouble();

            double dx = x2 - x1;
            double dy = y2 - y1;

            double dpx = px - x1;
            double dpy = py - y1;

            double dotProduct = dpx * dx + dpy * dy;
            double lengthSquared = dx * dx + dy * dy;
            double t = dotProduct / lengthSquared;

            double projX = x1 + t * dx;
            double projY = y1 + t * dy;

            System.out.printf("%.10f %.10f\n", projX, projY);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        double x1 = sc.nextDouble();
        double y1 = sc.nextDouble();
        double x2 = sc.nextDouble();
        double y2 = sc.nextDouble();

        int q = sc.nextInt();

        for (int i = 0; i < q; i++) {
            double px = sc.nextDouble();
            double py = sc.nextDouble();

            double dx = x2 - x1;
            double dy = y2 - y1;

            double dpx = px - x1;
            double dpy = py - y1;

            double dot = dpx * dx + dpy * dy;
            double lenSq = dx * dx + dy * dy;

            double t = dot / lenSq;

            double projX = x1 + t * dx;
            double projY = y1 + t * dy;

            System.out.printf("%.10f %.10f%n", projX, projY);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        double x1 = sc.nextDouble();
        double y1 = sc.nextDouble();
        double x2 = sc.nextDouble();
        double y2 = sc.nextDouble();

        int q = sc.nextInt();

        for (int i = 0; i < q; i++) {
            double px = sc.nextDouble();
            double py = sc.nextDouble();

            double dx = x2 - x1;
            double dy = y2 - y1;

            double dpx = px - x1;
            double dpy = py - y1;

            double dot = dpx * dx + dpy * dy;
            double len2 = dx * dx + dy * dy;
            double t = dot / len2;

            double projX = x1 + t * dx;
            double projY = y1 + t * dy;

            double refX = 2 * projX - px;
            double refY = 2 * projY - py;

            System.out.printf("%.10f %.10f\n", refX, refY);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        double x1 = sc.nextDouble();
        double y1 = sc.nextDouble();
        double x2 = sc.nextDouble();
        double y2 = sc.nextDouble();

        int q = sc.nextInt();

        for (int i = 0; i < q; i++) {
            double px = sc.nextDouble();
            double py = sc.nextDouble();

            double dx = x2 - x1;
            double dy = y2 - y1;

            double dpx = px - x1;
            double dpy = py - y1;

            double dot = dpx * dx + dpy * dy;
            double len2 = dx * dx + dy * dy;
            double t = dot / len2;

            double projX = x1 + t * dx;
            double projY = y1 + t * dy;

            double reflectX = 2 * projX - px;
            double reflectY = 2 * projY - py;

            System.out.printf("%.10f %.10f\n", reflectX, reflectY);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        double x1 = sc.nextDouble();
        double y1 = sc.nextDouble();
        double x2 = sc.nextDouble();
        double y2 = sc.nextDouble();

        int q = sc.nextInt();

        for (int i = 0; i < q; i++) {
            double px = sc.nextDouble();
            double py = sc.nextDouble();

            double dx = x2 - x1;
            double dy = y2 - y1;

            double dpx = px - x1;
            double dpy = py - y1;

            double dot = dpx * dx + dpy * dy;
            double len2 = dx * dx + dy * dy;
            double t = dot / len2;

            double footx = x1 + t * dx;
            double footy = y1 + t * dy;

            double rx = 2 * footx - px;
            double ry = 2 * footy - py;

            System.out.printf("%.10f %.10f\n", rx, ry);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        double x1 = sc.nextDouble();
        double y1 = sc.nextDouble();
        double x2 = sc.nextDouble();
        double y2 = sc.nextDouble();

        int q = sc.nextInt();

        for (int i = 0; i < q; i++) {
            double px = sc.nextDouble();
            double py = sc.nextDouble();

            double dx = x2 - x1;
            double dy = y2 - y1;

            double dpx = px - x1;
            double dpy = py - y1;

            double t = (dpx * dx + dpy * dy) / (dx * dx + dy * dy);
            double projX = x1 + t * dx;
            double projY = y1 + t * dy;

            double reflectX = 2 * projX - px;
            double reflectY = 2 * projY - py;

            System.out.printf("%.10f %.10f\n", reflectX, reflectY);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        double x1 = sc.nextDouble();
        double y1 = sc.nextDouble();
        double x2 = sc.nextDouble();
        double y2 = sc.nextDouble();

        int q = sc.nextInt();

        for (int i = 0; i < q; i++) {
            double px = sc.nextDouble();
            double py = sc.nextDouble();

            double dx = x2 - x1;
            double dy = y2 - y1;

            double dpx = px - x1;
            double dpy = py - y1;

            double t = (dpx * dx + dpy * dy) / (dx * dx + dy * dy);
            double projX = x1 + t * dx;
            double projY = y1 + t * dy;

            double refX = 2 * projX - px;
            double refY = 2 * projY - py;

            System.out.printf("%.10f %.10f\n", refX, refY);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int x0 = sc.nextInt();
        int y0 = sc.nextInt();
        int x1 = sc.nextInt();
        int y1 = sc.nextInt();

        int q = sc.nextInt();

        for (int i = 0; i < q; i++) {
            int x2 = sc.nextInt();
            int y2 = sc.nextInt();

            System.out.println(ccw(x0, y0, x1, y1, x2, y2));
        }

        sc.close();
    }

    static String ccw(int x0, int y0, int x1, int y1, int x2, int y2) {
        long cross = (long)(x1 - x0) * (y2 - y0) - (long)(y1 - y0) * (x2 - x0);

        if (cross > 0) {
            return "COUNTER_CLOCKWISE";
        } else if (cross < 0) {
            return "CLOCKWISE";
        } else {
            long dot = (long)(x2 - x0) * (x1 - x0) + (long)(y2 - y0) * (y1 - y0);
            long len2 = (long)(x1 - x0) * (x1 - x0) + (long)(y1 - y0) * (y1 - y0);

            if (dot < 0) {
                return "ONLINE_BACK";
            } else if (dot > len2) {
                return "ONLINE_FRONT";
            } else {
                return "ON_SEGMENT";
            }
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int x0 = sc.nextInt();
        int y0 = sc.nextInt();
        int x1 = sc.nextInt();
        int y1 = sc.nextInt();

        int q = sc.nextInt();

        for (int i = 0; i < q; i++) {
            int x2 = sc.nextInt();
            int y2 = sc.nextInt();

            System.out.println(ccw(x0, y0, x1, y1, x2, y2));
        }

        sc.close();
    }

    static String ccw(int x0, int y0, int x1, int y1, int x2, int y2) {
        long cross = (long)(x1 - x0) * (y2 - y0) - (long)(y1 - y0) * (x2 - x0);

        if (cross > 0) {
            return "COUNTER_CLOCKWISE";
        } else if (cross < 0) {
            return "CLOCKWISE";
        } else {
            long dot = (long)(x2 - x0) * (x1 - x0) + (long)(y2 - y0) * (y1 - y0);
            long len2 = (long)(x1 - x0) * (x1 - x0) + (long)(y1 - y0) * (y1 - y0);

            if (dot < 0) {
                return "ONLINE_BACK";
            } else if (dot > len2) {
                return "ONLINE_FRONT";
            } else {
                return "ON_SEGMENT";
            }
        }
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int m = sc.nextInt();

        int[] coins = new int[m];
        for (int i = 0; i < m; i++) {
            coins[i] = sc.nextInt();
        }

        int[] dp = new int[n + 1];
        Arrays.fill(dp, Integer.MAX_VALUE);
        dp[0] = 0;

        for (int i = 1; i <= n; i++) {
            for (int coin : coins) {
                if (coin <= i && dp[i - coin] != Integer.MAX_VALUE) {
                    dp[i] = Math.min(dp[i], dp[i - coin] + 1);
                }
            }
        }

        System.out.println(dp[n]);
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int m = sc.nextInt();

        int[] coins = new int[m];
        for (int i = 0; i < m; i++) {
            coins[i] = sc.nextInt();
        }

        int[] dp = new int[n + 1];
        Arrays.fill(dp, Integer.MAX_VALUE);
        dp[0] = 0;

        for (int i = 1; i <= n; i++) {
            for (int coin : coins) {
                if (coin <= i && dp[i - coin] != Integer.MAX_VALUE) {
                    dp[i] = Math.min(dp[i], dp[i - coin] + 1);
                }
            }
        }

        System.out.println(dp[n]);
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int m = sc.nextInt();

        int[] coins = new int[m];
        for (int i = 0; i < m; i++) {
            coins[i] = sc.nextInt();
        }

        int[] dp = new int[n + 1];
        Arrays.fill(dp, Integer.MAX_VALUE);
        dp[0] = 0;

        for (int i = 1; i <= n; i++) {
            for (int coin : coins) {
                if (coin <= i && dp[i - coin] != Integer.MAX_VALUE) {
                    dp[i] = Math.min(dp[i], dp[i - coin] + 1);
                }
            }
        }

        System.out.println(dp[n]);
    }
}

import java.util.*;

public class CoinChanging {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int m = sc.nextInt();

        int[] coins = new int[m];
        for (int i = 0; i < m; i++) {
            coins[i] = sc.nextInt();
        }

        int[] dp = new int[n + 1];
        Arrays.fill(dp, Integer.MAX_VALUE);
        dp[0] = 0;

        for (int i = 1; i <= n; i++) {
            for (int coin : coins) {
                if (coin <= i && dp[i - coin] != Integer.MAX_VALUE) {
                    dp[i] = Math.min(dp[i], dp[i - coin] + 1);
                }
            }
        }

        System.out.println(dp[n]);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int W = sc.nextInt();

        int[] values = new int[N];
        int[] weights = new int[N];

        for (int i = 0; i < N; i++) {
            values[i] = sc.nextInt();
            weights[i] = sc.nextInt();
        }

        int[][] dp = new int[N + 1][W + 1];

        for (int i = 1; i <= N; i++) {
            for (int w = 0; w <= W; w++) {
                dp[i][w] = dp[i-1][w];

                if (w >= weights[i-1]) {
                    dp[i][w] = Math.max(dp[i][w], dp[i-1][w-weights[i-1]] + values[i-1]);
                }
            }
        }

        System.out.println(dp[N][W]);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int N = sc.nextInt();
        int W = sc.nextInt();

        int[] values = new int[N];
        int[] weights = new int[N];

        for (int i = 0; i < N; i++) {
            values[i] = sc.nextInt();
            weights[i] = sc.nextInt();
        }

        int[][] dp = new int[N + 1][W + 1];

        for (int i = 1; i <= N; i++) {
            for (int w = 0; w <= W; w++) {
                dp[i][w] = dp[i-1][w];

                if (w >= weights[i-1]) {
                    dp[i][w] = Math.max(dp[i][w], dp[i-1][w-weights[i-1]] + values[i-1]);
                }
            }
        }

        System.out.println(dp[N][W]);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int W = sc.nextInt();

        int[] values = new int[N];
        int[] weights = new int[N];

        for (int i = 0; i < N; i++) {
            values[i] = sc.nextInt();
            weights[i] = sc.nextInt();
        }

        int[][] dp = new int[N + 1][W + 1];

        for (int i = 1; i <= N; i++) {
            for (int w = 0; w <= W; w++) {
                dp[i][w] = dp[i-1][w];

                if (w >= weights[i-1]) {
                    dp[i][w] = Math.max(dp[i][w], dp[i-1][w-weights[i-1]] + values[i-1]);
                }
            }
        }

        System.out.println(dp[N][W]);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int N = sc.nextInt();
        int W = sc.nextInt();

        int[] values = new int[N];
        int[] weights = new int[N];

        for (int i = 0; i < N; i++) {
            values[i] = sc.nextInt();
            weights[i] = sc.nextInt();
        }

        int[][] dp = new int[N + 1][W + 1];

        for (int i = 1; i <= N; i++) {
            for (int w = 0; w <= W; w++) {
                dp[i][w] = dp[i-1][w];

                if (w >= weights[i-1]) {
                    dp[i][w] = Math.max(dp[i][w], dp[i-1][w-weights[i-1]] + values[i-1]);
                }
            }
        }

        System.out.println(dp[N][W]);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int W = sc.nextInt();

        int[] values = new int[N];
        int[] weights = new int[N];

        for (int i = 0; i < N; i++) {
            values[i] = sc.nextInt();
            weights[i] = sc.nextInt();
        }

        int[][] dp = new int[N + 1][W + 1];

        for (int i = 1; i <= N; i++) {
            for (int w = 0; w <= W; w++) {
                dp[i][w] = dp[i-1][w];

                if (w >= weights[i-1]) {
                    dp[i][w] = Math.max(dp[i][w], dp[i-1][w-weights[i-1]] + values[i-1]);
                }
            }
        }

        System.out.println(dp[N][W]);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int W = sc.nextInt();

        int[] values = new int[N];
        int[] weights = new int[N];

        for (int i = 0; i < N; i++) {
            values[i] = sc.nextInt();
            weights[i] = sc.nextInt();
        }

        int[] dp = new int[W + 1];

        for (int i = 0; i < N; i++) {
            for (int w = weights[i]; w <= W; w++) {
                dp[w] = Math.max(dp[w], dp[w - weights[i]] + values[i]);
            }
        }

        System.out.println(dp[W]);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int W = sc.nextInt();

        int[] v = new int[N];
        int[] w = new int[N];
        for (int i = 0; i < N; i++) {
            v[i] = sc.nextInt();
            w[i] = sc.nextInt();
        }

        int[] dp = new int[W + 1];

        for (int i = 0; i < N; i++) {
            for (int j = w[i]; j <= W; j++) {
                dp[j] = Math.max(dp[j], dp[j - w[i]] + v[i]);
            }
        }

        System.out.println(dp[W]);

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int W = sc.nextInt();

        int[] values = new int[N];
        int[] weights = new int[N];

        for (int i = 0; i < N; i++) {
            values[i] = sc.nextInt();
            weights[i] = sc.nextInt();
        }

        int[] dp = new int[W + 1];

        for (int i = 0; i < N; i++) {
            for (int w = weights[i]; w <= W; w++) {
                dp[w] = Math.max(dp[w], dp[w - weights[i]] + values[i]);
            }
        }

        int maxValue = 0;
        for (int w = 0; w <= W; w++) {
            maxValue = Math.max(maxValue, dp[w]);
        }

        System.out.println(maxValue);
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int W = sc.nextInt();
        int[] v = new int[N];
        int[] w = new int[N];
        for (int i = 0; i < N; i++) {
            v[i] = sc.nextInt();
            w[i] = sc.nextInt();
        }
        int[] dp = new int[W + 1];
        for (int i = 0; i < N; i++) {
            for (int weight = w[i]; weight <= W; weight++) {
                dp[weight] = Math.max(dp[weight], dp[weight - w[i]] + v[i]);
            }
        }
        int ans = 0;
        for (int i = 0; i <= W; i++) {
            ans = Math.max(ans, dp[i]);
        }
        System.out.println(ans);
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int W = sc.nextInt();

        int[] values = new int[N];
        int[] weights = new int[N];

        for (int i = 0; i < N; i++) {
            values[i] = sc.nextInt();
            weights[i] = sc.nextInt();
        }

        int[] dp = new int[W + 1];

        for (int i = 0; i < N; i++) {
            for (int w = weights[i]; w <= W; w++) {
                dp[w] = Math.max(dp[w], dp[w - weights[i]] + values[i]);
            }
        }

        System.out.println(dp[W]);
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int W = sc.nextInt();

        int[] values = new int[N];
        int[] weights = new int[N];

        for (int i = 0; i < N; i++) {
            values[i] = sc.nextInt();
            weights[i] = sc.nextInt();
        }

        int[] dp = new int[W + 1];

        for (int i = 0; i < N; i++) {
            for (int w = weights[i]; w <= W; w++) {
                dp[w] = Math.max(dp[w], dp[w - weights[i]] + values[i]);
            }
        }

        System.out.println(dp[W]);
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] a = new int[n];

        for (int i = 0; i < n; i++) {
            a[i] = sc.nextInt();
        }

        List<Integer> lis = new ArrayList<>();

        for (int i = 0; i < n; i++) {
            int pos = Collections.binarySearch(lis, a[i]);
            if (pos < 0) {
                pos = -(pos + 1);
            }

            if (pos == lis.size()) {
                lis.add(a[i]);
            } else {
                lis.set(pos, a[i]);
            }
        }

        System.out.println(lis.size());
        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] a = new int[n];

        for (int i = 0; i < n; i++) {
            a[i] = sc.nextInt();
        }

        List<Integer> lis = new ArrayList<>();

        for (int i = 0; i < n; i++) {
            int pos = Collections.binarySearch(lis, a[i]);
            if (pos < 0) {
                pos = -(pos + 1);
            }

            if (pos == lis.size()) {
                lis.add(a[i]);
            } else {
                lis.set(pos, a[i]);
            }
        }

        System.out.println(lis.size());
        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] a = new int[n];

        for (int i = 0; i < n; i++) {
            a[i] = sc.nextInt();
        }

        List<Integer> lis = new ArrayList<>();

        for (int i = 0; i < n; i++) {
            int pos = Collections.binarySearch(lis, a[i]);
            if (pos < 0) {
                pos = -(pos + 1);
            }

            if (pos == lis.size()) {
                lis.add(a[i]);
            } else {
                lis.set(pos, a[i]);
            }
        }

        System.out.println(lis.size());
        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] a = new int[n];

        for (int i = 0; i < n; i++) {
            a[i] = sc.nextInt();
        }

        List<Integer> lis = new ArrayList<>();

        for (int i = 0; i < n; i++) {
            int pos = Collections.binarySearch(lis, a[i]);
            if (pos < 0) {
                pos = -(pos + 1);
            }

            if (pos == lis.size()) {
                lis.add(a[i]);
            } else {
                lis.set(pos, a[i]);
            }
        }

        System.out.println(lis.size());
        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] a = new int[n];

        for (int i = 0; i < n; i++) {
            a[i] = sc.nextInt();
        }

        List<Integer> lis = new ArrayList<>();

        for (int i = 0; i < n; i++) {
            int pos = Collections.binarySearch(lis, a[i]);
            if (pos < 0) {
                pos = -(pos + 1);
            }

            if (pos == lis.size()) {
                lis.add(a[i]);
            } else {
                lis.set(pos, a[i]);
            }
        }

        System.out.println(lis.size());
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] a = new int[n];
        for (int i = 0; i < n; i++) {
            a[i] = sc.nextInt();
        }

        List<Integer> colors = new ArrayList<>();

        for (int i = 0; i < n; i++) {
            int pos = Collections.binarySearch(colors, a[i]);
            if (pos < 0) {
                pos = -(pos + 1);
            }

            if (pos == colors.size()) {
                colors.add(a[i]);
            } else {
                colors.set(pos, a[i]);
            }
        }

        System.out.println(colors.size());
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String s1 = sc.nextLine();
        String s2 = sc.nextLine();

        int m = s1.length();
        int n = s2.length();

        int[][] dp = new int[m + 1][n + 1];

        for (int i = 0; i <= m; i++) {
            dp[i][0] = i;
        }
        for (int j = 0; j <= n; j++) {
            dp[0][j] = j;
        }

        for (int i = 1; i <= m; i++) {
            for (int j = 1; j <= n; j++) {
                if (s1.charAt(i - 1) == s2.charAt(j - 1)) {
                    dp[i][j] = dp[i - 1][j - 1];
                } else {
                    dp[i][j] = 1 + Math.min(
                        Math.min(dp[i - 1][j],
                                dp[i][j - 1]),
                        dp[i - 1][j - 1]
                    );
                }
            }
        }

        System.out.println(dp[m][n]);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String s1 = sc.nextLine();
        String s2 = sc.nextLine();

        int m = s1.length();
        int n = s2.length();

        int[][] dp = new int[m + 1][n + 1];

        for (int i = 0; i <= m; i++) {
            dp[i][0] = i;
        }
        for (int j = 0; j <= n; j++) {
            dp[0][j] = j;
        }

        for (int i = 1; i <= m; i++) {
            for (int j = 1; j <= n; j++) {
                if (s1.charAt(i - 1) == s2.charAt(j - 1)) {
                    dp[i][j] = dp[i - 1][j - 1];
                } else {
                    dp[i][j] = 1 + Math.min(
                        Math.min(dp[i - 1][j],
                                dp[i][j - 1]),
                        dp[i - 1][j - 1]
                    );
                }
            }
        }

        System.out.println(dp[m][n]);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String s1 = sc.nextLine();
        String s2 = sc.nextLine();

        int m = s1.length();
        int n = s2.length();

        int[][] dp = new int[m + 1][n + 1];

        for (int i = 0; i <= m; i++) {
            dp[i][0] = i;
        }
        for (int j = 0; j <= n; j++) {
            dp[0][j] = j;
        }

        for (int i = 1; i <= m; i++) {
            for (int j = 1; j <= n; j++) {
                if (s1.charAt(i - 1) == s2.charAt(j - 1)) {
                    dp[i][j] = dp[i - 1][j - 1];
                } else {
                    dp[i][j] = 1 + Math.min(
                        Math.min(dp[i - 1][j],
                                dp[i][j - 1]),
                        dp[i - 1][j - 1]
                    );
                }
            }
        }

        System.out.println(dp[m][n]);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String s1 = sc.nextLine();
        String s2 = sc.nextLine();

        int m = s1.length();
        int n = s2.length();

        int[][] dp = new int[m + 1][n + 1];

        for (int i = 0; i <= m; i++) {
            dp[i][0] = i;
        }
        for (int j = 0; j <= n; j++) {
            dp[0][j] = j;
        }

        for (int i = 1; i <= m; i++) {
            for (int j = 1; j <= n; j++) {
                if (s1.charAt(i - 1) == s2.charAt(j - 1)) {
                    dp[i][j] = dp[i - 1][j - 1];
                } else {
                    dp[i][j] = 1 + Math.min(
                        Math.min(dp[i - 1][j],
                                dp[i][j - 1]),
                        dp[i - 1][j - 1]
                    );
                }
            }
        }

        System.out.println(dp[m][n]);
    }
}

import java.util.*;

public class TSP {
    static final int INF = Integer.MAX_VALUE;

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int V = sc.nextInt();
        int E = sc.nextInt();

        int[][] dist = new int[V][V];
        for (int i = 0; i < V; i++) {
            Arrays.fill(dist[i], INF);
        }

        for (int i = 0; i < E; i++) {
            int s = sc.nextInt();
            int t = sc.nextInt();
            int d = sc.nextInt();
            dist[s][t] = d;
        }

        int[][] dp = new int[1 << V][V];
        for (int i = 0; i < (1 << V); i++) {
            Arrays.fill(dp[i], INF);
        }

        dp[1][0] = 0;

        for (int mask = 0; mask < (1 << V); mask++) {
            for (int v = 0; v < V; v++) {
                if (dp[mask][v] == INF) continue;

                for (int next = 0; next < V; next++) {
                    if ((mask & (1 << next)) != 0) continue;
                    if (dist[v][next] == INF) continue;

                    int newMask = mask | (1 << next);
                    dp[newMask][next] = Math.min(dp[newMask][next], dp[mask][v] + dist[v][next]);
                }
            }
        }

        int allVisited = (1 << V) - 1;
        int result = INF;

        for (int v = 1; v < V; v++) {
            if (dp[allVisited][v] != INF && dist[v][0] != INF) {
                result = Math.min(result, dp[allVisited][v] + dist[v][0]);
            }
        }

        System.out.println(result == INF ? -1 : result);
    }
}

import java.util.*;

public class Main {
    static final int INF = Integer.MAX_VALUE;

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int V = sc.nextInt();
        int E = sc.nextInt();

        int[][] dist = new int[V][V];
        for (int i = 0; i < V; i++) {
            Arrays.fill(dist[i], INF);
        }

        for (int i = 0; i < E; i++) {
            int s = sc.nextInt();
            int t = sc.nextInt();
            int d = sc.nextInt();
            dist[s][t] = d;
        }

        int[][] dp = new int[1 << V][V];
        for (int i = 0; i < (1 << V); i++) {
            Arrays.fill(dp[i], INF);
        }

        dp[1][0] = 0;

        for (int mask = 0; mask < (1 << V); mask++) {
            for (int v = 0; v < V; v++) {
                if (dp[mask][v] == INF) continue;

                for (int next = 0; next < V; next++) {
                    if ((mask & (1 << next)) != 0) continue;
                    if (dist[v][next] == INF) continue;

                    int newMask = mask | (1 << next);
                    dp[newMask][next] = Math.min(dp[newMask][next], dp[mask][v] + dist[v][next]);
                }
            }
        }

        int allVisited = (1 << V) - 1;
        int result = INF;

        for (int v = 1; v < V; v++) {
            if (dp[allVisited][v] != INF && dist[v][0] != INF) {
                result = Math.min(result, dp[allVisited][v] + dist[v][0]);
            }
        }

        System.out.println(result == INF ? -1 : result);
    }
}

import java.util.Scanner;

public class Main {
    static class UnionFind {
        private int[] parent;
        private int[] rank;

        public UnionFind(int n) {
            parent = new int[n];
            rank = new int[n];
            for (int i = 0; i < n; i++) {
                parent[i] = i;
                rank[i] = 0;
            }
        }

        public int find(int x) {
            if (parent[x] != x) {
                parent[x] = find(parent[x]);
            }
            return parent[x];
        }

        public void unite(int x, int y) {
            int rootX = find(x);
            int rootY = find(y);

            if (rootX != rootY) {
                if (rank[rootX] < rank[rootY]) {
                    parent[rootX] = rootY;
                } else if (rank[rootX] > rank[rootY]) {
                    parent[rootY] = rootX;
                } else {
                    parent[rootY] = rootX;
                    rank[rootX]++;
                }
            }
        }

        public boolean same(int x, int y) {
            return find(x) == find(y);
        }
    }

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        int q = scanner.nextInt();

        UnionFind uf = new UnionFind(n);

        for (int i = 0; i < q; i++) {
            int com = scanner.nextInt();
            int x = scanner.nextInt();
            int y = scanner.nextInt();

            if (com == 0) {
                uf.unite(x, y);
            } else {
                System.out.println(uf.same(x, y) ? 1 : 0);
            }
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    static class UnionFind {
        private int[] parent;
        private int[] rank;

        public UnionFind(int n) {
            parent = new int[n];
            rank = new int[n];
            for (int i = 0; i < n; i++) {
                parent[i] = i;
                rank[i] = 0;
            }
        }

        public int find(int x) {
            if (parent[x] != x) {
                parent[x] = find(parent[x]);
            }
            return parent[x];
        }

        public void unite(int x, int y) {
            int rootX = find(x);
            int rootY = find(y);

            if (rootX != rootY) {
                if (rank[rootX] < rank[rootY]) {
                    parent[rootX] = rootY;
                } else if (rank[rootX] > rank[rootY]) {
                    parent[rootY] = rootX;
                } else {
                    parent[rootY] = rootX;
                    rank[rootX]++;
                }
            }
        }

        public boolean same(int x, int y) {
            return find(x) == find(y);
        }
    }

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        int q = scanner.nextInt();

        UnionFind uf = new UnionFind(n);

        for (int i = 0; i < q; i++) {
            int com = scanner.nextInt();
            int x = scanner.nextInt();
            int y = scanner.nextInt();

            if (com == 0) {
                uf.unite(x, y);
            } else {
                System.out.println(uf.same(x, y) ? 1 : 0);
            }
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    static class UnionFind {
        private int[] parent;
        private int[] rank;

        public UnionFind(int n) {
            parent = new int[n];
            rank = new int[n];
            for (int i = 0; i < n; i++) {
                parent[i] = i;
                rank[i] = 0;
            }
        }

        public int find(int x) {
            if (parent[x] != x) {
                parent[x] = find(parent[x]);
            }
            return parent[x];
        }

        public void unite(int x, int y) {
            int rootX = find(x);
            int rootY = find(y);

            if (rootX != rootY) {
                if (rank[rootX] < rank[rootY]) {
                    parent[rootX] = rootY;
                } else if (rank[rootX] > rank[rootY]) {
                    parent[rootY] = rootX;
                } else {
                    parent[rootY] = rootX;
                    rank[rootX]++;
                }
            }
        }

        public boolean same(int x, int y) {
            return find(x) == find(y);
        }
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int q = sc.nextInt();

        UnionFind uf = new UnionFind(n);

        for (int i = 0; i < q; i++) {
            int com = sc.nextInt();
            int x = sc.nextInt();
            int y = sc.nextInt();

            if (com == 0) {
                uf.unite(x, y);
            } else {
                System.out.println(uf.same(x, y) ? 1 : 0);
            }
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    static class UnionFind {
        private int[] parent;
        private int[] rank;

        public UnionFind(int n) {
            parent = new int[n];
            rank = new int[n];
            for (int i = 0; i < n; i++) {
                parent[i] = i;
                rank[i] = 0;
            }
        }

        public int find(int x) {
            if (parent[x] != x) {
                parent[x] = find(parent[x]);
            }
            return parent[x];
        }

        public void unite(int x, int y) {
            int rootX = find(x);
            int rootY = find(y);

            if (rootX != rootY) {
                if (rank[rootX] < rank[rootY]) {
                    parent[rootX] = rootY;
                } else if (rank[rootX] > rank[rootY]) {
                    parent[rootY] = rootX;
                } else {
                    parent[rootY] = rootX;
                    rank[rootX]++;
                }
            }
        }

        public boolean same(int x, int y) {
            return find(x) == find(y);
        }
    }

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        int q = scanner.nextInt();

        UnionFind uf = new UnionFind(n);

        for (int i = 0; i < q; i++) {
            int com = scanner.nextInt();
            int x = scanner.nextInt();
            int y = scanner.nextInt();

            if (com == 0) {
                uf.unite(x, y);
            } else {
                System.out.println(uf.same(x, y) ? 1 : 0);
            }
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    private static class SegmentTree {
        private int[] tree;
        private int n;

        public SegmentTree(int size) {
            n = size;
            tree = new int[4 * n];
            build(1, 0, n - 1);
        }

        private void build(int node, int start, int end) {
            if (start == end) {
                tree[node] = Integer.MAX_VALUE;
            } else {
                int mid = (start + end) / 2;
                build(2 * node, start, mid);
                build(2 * node + 1, mid + 1, end);
                tree[node] = Math.min(tree[2 * node], tree[2 * node + 1]);
            }
        }

        public void update(int node, int start, int end, int idx, int val) {
            if (start == end) {
                tree[node] = val;
            } else {
                int mid = (start + end) / 2;
                if (idx <= mid) {
                    update(2 * node, start, mid, idx, val);
                } else {
                    update(2 * node + 1, mid + 1, end, idx, val);
                }
                tree[node] = Math.min(tree[2 * node], tree[2 * node + 1]);
            }
        }

        public int query(int node, int start, int end, int l, int r) {
            if (r < start || end < l) {
                return Integer.MAX_VALUE;
            }
            if (l <= start && end <= r) {
                return tree[node];
            }
            int mid = (start + end) / 2;
            int p1 = query(2 * node, start, mid, l, r);
            int p2 = query(2 * node + 1, mid + 1, end, l, r);
            return Math.min(p1, p2);
        }

        public void update(int idx, int val) {
            update(1, 0, n - 1, idx, val);
        }

        public int query(int l, int r) {
            return query(1, 0, n - 1, l, r);
        }
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int q = sc.nextInt();

        SegmentTree st = new SegmentTree(n);

        for (int i = 0; i < q; i++) {
            int com = sc.nextInt();
            int x = sc.nextInt();
            int y = sc.nextInt();

            if (com == 0) {
                st.update(x, y);
            } else {
                System.out.println(st.query(x, y));
            }
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    private static class SegmentTree {
        private int[] tree;
        private int n;

        public SegmentTree(int size) {
            n = size;
            tree = new int[4 * n];
            build(1, 0, n - 1);
        }

        private void build(int node, int start, int end) {
            if (start == end) {
                tree[node] = Integer.MAX_VALUE;
            } else {
                int mid = (start + end) / 2;
                build(2 * node, start, mid);
                build(2 * node + 1, mid + 1, end);
                tree[node] = Math.min(tree[2 * node], tree[2 * node + 1]);
            }
        }

        public void update(int node, int start, int end, int idx, int val) {
            if (start == end) {
                tree[node] = val;
            } else {
                int mid = (start + end) / 2;
                if (idx <= mid) {
                    update(2 * node, start, mid, idx, val);
                } else {
                    update(2 * node + 1, mid + 1, end, idx, val);
                }
                tree[node] = Math.min(tree[2 * node], tree[2 * node + 1]);
            }
        }

        public int query(int node, int start, int end, int l, int r) {
            if (r < start || end < l) {
                return Integer.MAX_VALUE;
            }
            if (l <= start && end <= r) {
                return tree[node];
            }
            int mid = (start + end) / 2;
            int p1 = query(2 * node, start, mid, l, r);
            int p2 = query(2 * node + 1, mid + 1, end, l, r);
            return Math.min(p1, p2);
        }

        public void update(int idx, int val) {
            update(1, 0, n - 1, idx, val);
        }

        public int query(int l, int r) {
            return query(1, 0, n - 1, l, r);
        }
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int q = sc.nextInt();

        SegmentTree st = new SegmentTree(n);

        for (int i = 0; i < q; i++) {
            int com = sc.nextInt();
            int x = sc.nextInt();
            int y = sc.nextInt();

            if (com == 0) {
                st.update(x, y);
            } else {
                System.out.println(st.query(x, y));
            }
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int q = sc.nextInt();

        long[] arr = new long[n + 1];

        for (int i = 0; i < q; i++) {
            int com = sc.nextInt();
            int x = sc.nextInt();
            int y = sc.nextInt();

            if (com == 0) {
                arr[x] += y;
            } else {
                long sum = 0;
                for (int j = x; j <= y; j++) {
                    sum += arr[j];
                }
                System.out.println(sum);
            }
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int q = sc.nextInt();

        long[] arr = new long[n + 1];

        for (int i = 0; i < q; i++) {
            int com = sc.nextInt();
            int x = sc.nextInt();
            int y = sc.nextInt();

            if (com == 0) {
                arr[x] += y;
            } else {
                long sum = 0;
                for (int j = x; j <= y; j++) {
                    sum += arr[j];
                }
                System.out.println(sum);
            }
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int q = sc.nextInt();

        long[] a = new long[n + 1];

        for (int i = 0; i < q; i++) {
            int com = sc.nextInt();
            int x = sc.nextInt();
            int y = sc.nextInt();

            if (com == 0) {
                a[x] += y;
            } else {
                long sum = 0;
                for (int j = x; j <= y; j++) {
                    sum += a[j];
                }
                System.out.println(sum);
            }
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int q = sc.nextInt();

        int[] arr = new int[n];
        Arrays.fill(arr, Integer.MAX_VALUE);

        for (int i = 0; i < q; i++) {
            int type = sc.nextInt();

            if (type == 0) {
                int s = sc.nextInt();
                int t = sc.nextInt();
                int x = sc.nextInt();

                for (int j = s; j <= t; j++) {
                    arr[j] = x;
                }
            } else {
                int idx = sc.nextInt();
                System.out.println(arr[idx]);
            }
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int q = sc.nextInt();

        int[] arr = new int[n];
        Arrays.fill(arr, Integer.MAX_VALUE);

        for (int i = 0; i < q; i++) {
            int type = sc.nextInt();

            if (type == 0) {
                int s = sc.nextInt();
                int t = sc.nextInt();
                int x = sc.nextInt();

                for (int j = s; j <= t; j++) {
                    arr[j] = x;
                }
            } else {
                int idx = sc.nextInt();
                System.out.println(arr[idx]);
            }
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int q = sc.nextInt();

        int[] arr = new int[n];
        Arrays.fill(arr, Integer.MAX_VALUE);

        for (int i = 0; i < q; i++) {
            int type = sc.nextInt();

            if (type == 0) {
                int s = sc.nextInt();
                int t = sc.nextInt();
                int x = sc.nextInt();

                for (int j = s; j <= t; j++) {
                    arr[j] = x;
                }
            } else {
                int idx = sc.nextInt();
                System.out.println(arr[idx]);
            }
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int q = sc.nextInt();

        long[] arr = new long[n + 1];

        for (int i = 0; i < q; i++) {
            int type = sc.nextInt();
            if (type == 0) {
                int s = sc.nextInt();
                int t = sc.nextInt();
                int x = sc.nextInt();
                for (int j = s; j <= t; j++) {
                    arr[j] += x;
                }
            } else {
                int s = sc.nextInt();
                int t = sc.nextInt();
                long sum = 0;
                for (int j = s; j <= t; j++) {
                    sum += arr[j];
                }
                System.out.println(sum);
            }
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int q = sc.nextInt();

        long[] arr = new long[n + 1];

        for (int i = 0; i < q; i++) {
            int type = sc.nextInt();
            if (type == 0) {
                int s = sc.nextInt();
                int t = sc.nextInt();
                int x = sc.nextInt();
                for (int j = s; j <= t; j++) {
                    arr[j] += x;
                }
            } else {
                int s = sc.nextInt();
                int t = sc.nextInt();
                long sum = 0;
                for (int j = s; j <= t; j++) {
                    sum += arr[j];
                }
                System.out.println(sum);
            }
        }
        sc.close();
    }
}

import java.util.*;

public class Main {
    static class Edge {
        int to, cost;
        Edge(int to, int cost) {
            this.to = to;
            this.cost = cost;
        }
    }

    static class Node implements Comparable<Node> {
        int vertex, dist;
        Node(int vertex, int dist) {
            this.vertex = vertex;
            this.dist = dist;
        }

        public int compareTo(Node other) {
            return Integer.compare(this.dist, other.dist);
        }
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int V = sc.nextInt();
        int E = sc.nextInt();
        int r = sc.nextInt();

        List<List<Edge>> graph = new ArrayList<>();
        for (int i = 0; i < V; i++) {
            graph.add(new ArrayList<>());
        }

        for (int i = 0; i < E; i++) {
            int s = sc.nextInt();
            int t = sc.nextInt();
            int d = sc.nextInt();
            graph.get(s).add(new Edge(t, d));
        }

        int[] dist = new int[V];
        Arrays.fill(dist, Integer.MAX_VALUE);
        dist[r] = 0;

        PriorityQueue<Node> pq = new PriorityQueue<>();
        pq.offer(new Node(r, 0));

        while (!pq.isEmpty()) {
            Node current = pq.poll();
            int u = current.vertex;
            int d = current.dist;

            if (d > dist[u]) continue;

            for (Edge edge : graph.get(u)) {
                int v = edge.to;
                int cost = edge.cost;

                if (dist[u] + cost < dist[v]) {
                    dist[v] = dist[u] + cost;
                    pq.offer(new Node(v, dist[v]));
                }
            }
        }

        for (int i = 0; i < V; i++) {
            if (dist[i] == Integer.MAX_VALUE) {
                System.out.println("INF");
            } else {
                System.out.println(dist[i]);
            }
        }
    }
}

import java.util.*;

public class Main {
    static class Edge {
        int to, cost;
        Edge(int to, int cost) {
            this.to = to;
            this.cost = cost;
        }
    }

    static class Node implements Comparable<Node> {
        int vertex, dist;
        Node(int vertex, int dist) {
            this.vertex = vertex;
            this.dist = dist;
        }

        public int compareTo(Node other) {
            return Integer.compare(this.dist, other.dist);
        }
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int V = sc.nextInt();
        int E = sc.nextInt();
        int r = sc.nextInt();

        List<List<Edge>> graph = new ArrayList<>();
        for (int i = 0; i < V; i++) {
            graph.add(new ArrayList<>());
        }

        for (int i = 0; i < E; i++) {
            int s = sc.nextInt();
            int t = sc.nextInt();
            int d = sc.nextInt();
            graph.get(s).add(new Edge(t, d));
        }

        int[] dist = new int[V];
        Arrays.fill(dist, Integer.MAX_VALUE);
        dist[r] = 0;

        PriorityQueue<Node> pq = new PriorityQueue<>();
        pq.offer(new Node(r, 0));

        while (!pq.isEmpty()) {
            Node current = pq.poll();
            int u = current.vertex;
            int d = current.dist;

            if (d > dist[u]) continue;

            for (Edge edge : graph.get(u)) {
                int v = edge.to;
                int cost = edge.cost;

                if (dist[u] + cost < dist[v]) {
                    dist[v] = dist[u] + cost;
                    pq.offer(new Node(v, dist[v]));
                }
            }
        }

        for (int i = 0; i < V; i++) {
            if (dist[i] == Integer.MAX_VALUE) {
                System.out.println("INF");
            } else {
                System.out.println(dist[i]);
            }
        }
    }
}

import java.util.*;

public class Main {
    static class Edge {
        int from, to, cost;
        Edge(int from, int to, int cost) {
            this.from = from;
            this.to = to;
            this.cost = cost;
        }
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int V = sc.nextInt();
        int E = sc.nextInt();
        int r = sc.nextInt();

        List<Edge> edges = new ArrayList<>();
        for (int i = 0; i < E; i++) {
            int s = sc.nextInt();
            int t = sc.nextInt();
            int d = sc.nextInt();
            edges.add(new Edge(s, t, d));
        }

        long[] dist = new long[V];
        Arrays.fill(dist, Long.MAX_VALUE);
        dist[r] = 0;

        for (int i = 0; i < V - 1; i++) {
            for (Edge e : edges) {
                if (dist[e.from] != Long.MAX_VALUE && dist[e.from] + e.cost < dist[e.to]) {
                    dist[e.to] = dist[e.from] + e.cost;
                }
            }
        }

        boolean hasNegativeCycle = false;
        for (Edge e : edges) {
            if (dist[e.from] != Long.MAX_VALUE && dist[e.from] + e.cost < dist[e.to]) {
                hasNegativeCycle = true;
                break;
            }
        }

        if (hasNegativeCycle) {
            System.out.println("NEGATIVE CYCLE");
        } else {
            for (int i = 0; i < V; i++) {
                if (dist[i] == Long.MAX_VALUE) {
                    System.out.println("INF");
                } else {
                    System.out.println(dist[i]);
                }
            }
        }
    }
}

import java.util.*;

public class Main {
    static class Edge {
        int from, to, cost;
        Edge(int from, int to, int cost) {
            this.from = from;
            this.to = to;
            this.cost = cost;
        }
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int V = sc.nextInt();
        int E = sc.nextInt();
        int r = sc.nextInt();

        List<Edge> edges = new ArrayList<>();
        for (int i = 0; i < E; i++) {
            int s = sc.nextInt();
            int t = sc.nextInt();
            int d = sc.nextInt();
            edges.add(new Edge(s, t, d));
        }

        long[] dist = new long[V];
        Arrays.fill(dist, Long.MAX_VALUE);
        dist[r] = 0;

        for (int i = 0; i < V - 1; i++) {
            for (Edge e : edges) {
                if (dist[e.from] != Long.MAX_VALUE && dist[e.from] + e.cost < dist[e.to]) {
                    dist[e.to] = dist[e.from] + e.cost;
                }
            }
        }

        boolean hasNegativeCycle = false;
        for (Edge e : edges) {
            if (dist[e.from] != Long.MAX_VALUE && dist[e.from] + e.cost < dist[e.to]) {
                hasNegativeCycle = true;
                break;
            }
        }

        if (hasNegativeCycle) {
            System.out.println("NEGATIVE CYCLE");
        } else {
            for (int i = 0; i < V; i++) {
                if (dist[i] == Long.MAX_VALUE) {
                    System.out.println("INF");
                } else {
                    System.out.println(dist[i]);
                }
            }
        }
    }
}

import java.util.*;

public class Main {
    static class Edge {
        int from, to, cost;
        Edge(int from, int to, int cost) {
            this.from = from;
            this.to = to;
            this.cost = cost;
        }
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int V = sc.nextInt();
        int E = sc.nextInt();
        int r = sc.nextInt();

        List<Edge> edges = new ArrayList<>();
        for (int i = 0; i < E; i++) {
            int s = sc.nextInt();
            int t = sc.nextInt();
            int d = sc.nextInt();
            edges.add(new Edge(s, t, d));
        }

        long[] dist = new long[V];
        Arrays.fill(dist, Long.MAX_VALUE);
        dist[r] = 0;

        for (int i = 0; i < V - 1; i++) {
            for (Edge e : edges) {
                if (dist[e.from] != Long.MAX_VALUE && dist[e.from] + e.cost < dist[e.to]) {
                    dist[e.to] = dist[e.from] + e.cost;
                }
            }
        }

        boolean hasNegativeCycle = false;
        for (Edge e : edges) {
            if (dist[e.from] != Long.MAX_VALUE && dist[e.from] + e.cost < dist[e.to]) {
                hasNegativeCycle = true;
                break;
            }
        }

        if (hasNegativeCycle) {
            System.out.println("NEGATIVE CYCLE");
        } else {
            for (int i = 0; i < V; i++) {
                if (dist[i] == Long.MAX_VALUE) {
                    System.out.println("INF");
                } else {
                    System.out.println(dist[i]);
                }
            }
        }
    }
}

import java.util.*;

public class Main {
    static class Edge {
        int from, to, cost;
        Edge(int from, int to, int cost) {
            this.from = from;
            this.to = to;
            this.cost = cost;
        }
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int V = sc.nextInt();
        int E = sc.nextInt();
        int r = sc.nextInt();

        List<Edge> edges = new ArrayList<>();
        for (int i = 0; i < E; i++) {
            int s = sc.nextInt();
            int t = sc.nextInt();
            int d = sc.nextInt();
            edges.add(new Edge(s, t, d));
        }

        long[] dist = new long[V];
        Arrays.fill(dist, Long.MAX_VALUE);
        dist[r] = 0;

        for (int i = 0; i < V - 1; i++) {
            for (Edge e : edges) {
                if (dist[e.from] != Long.MAX_VALUE && dist[e.from] + e.cost < dist[e.to]) {
                    dist[e.to] = dist[e.from] + e.cost;
                }
            }
        }

        boolean hasNegativeCycle = false;
        for (Edge e : edges) {
            if (dist[e.from] != Long.MAX_VALUE && dist[e.from] + e.cost < dist[e.to]) {
                hasNegativeCycle = true;
                break;
            }
        }

        if (hasNegativeCycle) {
            System.out.println("NEGATIVE CYCLE");
        } else {
            for (int i = 0; i < V; i++) {
                if (dist[i] == Long.MAX_VALUE) {
                    System.out.println("INF");
                } else {
                    System.out.println(dist[i]);
                }
            }
        }
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int V = sc.nextInt();
        int E = sc.nextInt();

        final long INF = Long.MAX_VALUE / 2;
        long[][] dist = new long[V][V];

        for (int i = 0; i < V; i++) {
            for (int j = 0; j < V; j++) {
                if (i == j) {
                    dist[i][j] = 0;
                } else {
                    dist[i][j] = INF;
                }
            }
        }

        for (int i = 0; i < E; i++) {
            int s = sc.nextInt();
            int t = sc.nextInt();
            long d = sc.nextLong();
            dist[s][t] = d;
        }

        for (int k = 0; k < V; k++) {
            for (int i = 0; i < V; i++) {
                for (int j = 0; j < V; j++) {
                    if (dist[i][k] != INF && dist[k][j] != INF) {
                        dist[i][j] = Math.min(dist[i][j], dist[i][k] + dist[k][j]);
                    }
                }
            }
        }

        boolean hasNegativeCycle = false;
        for (int i = 0; i < V; i++) {
            if (dist[i][i] < 0) {
                hasNegativeCycle = true;
                break;
            }
        }

        if (hasNegativeCycle) {
            System.out.println("NEGATIVE CYCLE");
        } else {
            for (int i = 0; i < V; i++) {
                for (int j = 0; j < V; j++) {
                    if (j > 0) System.out.print(" ");
                    if (dist[i][j] == INF) {
                        System.out.print("INF");
                    } else {
                        System.out.print(dist[i][j]);
                    }
                }
                System.out.println();
            }
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int V = sc.nextInt();
        int E = sc.nextInt();

        final long INF = Long.MAX_VALUE / 2;
        long[][] dist = new long[V][V];

        for (int i = 0; i < V; i++) {
            for (int j = 0; j < V; j++) {
                if (i == j) {
                    dist[i][j] = 0;
                } else {
                    dist[i][j] = INF;
                }
            }
        }

        for (int i = 0; i < E; i++) {
            int s = sc.nextInt();
            int t = sc.nextInt();
            long d = sc.nextLong();
            dist[s][t] = d;
        }

        for (int k = 0; k < V; k++) {
            for (int i = 0; i < V; i++) {
                for (int j = 0; j < V; j++) {
                    if (dist[i][k] != INF && dist[k][j] != INF) {
                        dist[i][j] = Math.min(dist[i][j], dist[i][k] + dist[k][j]);
                    }
                }
            }
        }

        boolean hasNegativeCycle = false;
        for (int i = 0; i < V; i++) {
            if (dist[i][i] < 0) {
                hasNegativeCycle = true;
                break;
            }
        }

        if (hasNegativeCycle) {
            System.out.println("NEGATIVE CYCLE");
        } else {
            for (int i = 0; i < V; i++) {
                for (int j = 0; j < V; j++) {
                    if (j > 0) System.out.print(" ");
                    if (dist[i][j] == INF) {
                        System.out.print("INF");
                    } else {
                        System.out.print(dist[i][j]);
                    }
                }
                System.out.println();
            }
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    static class Edge implements Comparable<Edge> {
        int u, v, weight;

        Edge(int u, int v, int weight) {
            this.u = u;
            this.v = v;
            this.weight = weight;
        }

        @Override
        public int compareTo(Edge other) {
            return Integer.compare(this.weight, other.weight);
        }
    }

    static class UnionFind {
        int[] parent, rank;

        UnionFind(int n) {
            parent = new int[n];
            rank = new int[n];
            for (int i = 0; i < n; i++) {
                parent[i] = i;
                rank[i] = 0;
            }
        }

        int find(int x) {
            if (parent[x] != x) {
                parent[x] = find(parent[x]);
            }
            return parent[x];
        }

        boolean union(int x, int y) {
            int px = find(x);
            int py = find(y);

            if (px == py) return false;

            if (rank[px] < rank[py]) {
                parent[px] = py;
            } else if (rank[px] > rank[py]) {
                parent[py] = px;
            } else {
                parent[py] = px;
                rank[px]++;
            }
            return true;
        }
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int V = sc.nextInt();
        int E = sc.nextInt();

        List<Edge> edges = new ArrayList<>();

        for (int i = 0; i < E; i++) {
            int u = sc.nextInt();
            int v = sc.nextInt();
            int w = sc.nextInt();
            edges.add(new Edge(u, v, w));
        }

        Collections.sort(edges);

        UnionFind uf = new UnionFind(V);
        int mstWeight = 0;
        int edgesUsed = 0;

        for (Edge edge : edges) {
            if (uf.union(edge.u, edge.v)) {
                mstWeight += edge.weight;
                edgesUsed++;
                if (edgesUsed == V - 1) break;
            }
        }

        System.out.println(mstWeight);
    }
}

import java.util.*;

public class Main {
    static class Edge implements Comparable<Edge> {
        int u, v, weight;

        Edge(int u, int v, int weight) {
            this.u = u;
            this.v = v;
            this.weight = weight;
        }

        @Override
        public int compareTo(Edge other) {
            return Integer.compare(this.weight, other.weight);
        }
    }

    static class UnionFind {
        int[] parent, rank;

        UnionFind(int n) {
            parent = new int[n];
            rank = new int[n];
            for (int i = 0; i < n; i++) {
                parent[i] = i;
                rank[i] = 0;
            }
        }

        int find(int x) {
            if (parent[x] != x) {
                parent[x] = find(parent[x]);
            }
            return parent[x];
        }

        boolean union(int x, int y) {
            int px = find(x);
            int py = find(y);

            if (px == py) return false;

            if (rank[px] < rank[py]) {
                parent[px] = py;
            } else if (rank[px] > rank[py]) {
                parent[py] = px;
            } else {
                parent[py] = px;
                rank[px]++;
            }
            return true;
        }
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int V = sc.nextInt();
        int E = sc.nextInt();

        List<Edge> edges = new ArrayList<>();

        for (int i = 0; i < E; i++) {
            int u = sc.nextInt();
            int v = sc.nextInt();
            int w = sc.nextInt();
            edges.add(new Edge(u, v, w));
        }

        Collections.sort(edges);

        UnionFind uf = new UnionFind(V);
        int mstWeight = 0;
        int edgesAdded = 0;

        for (Edge edge : edges) {
            if (uf.union(edge.u, edge.v)) {
                mstWeight += edge.weight;
                edgesAdded++;
                if (edgesAdded == V - 1) break;
            }
        }

        System.out.println(mstWeight);
    }
}

import java.util.*;

public class Main {
    static class Edge implements Comparable<Edge> {
        int u, v, weight;

        Edge(int u, int v, int weight) {
            this.u = u;
            this.v = v;
            this.weight = weight;
        }

        @Override
        public int compareTo(Edge other) {
            return Integer.compare(this.weight, other.weight);
        }
    }

    static class UnionFind {
        int[] parent, rank;

        UnionFind(int n) {
            parent = new int[n];
            rank = new int[n];
            for (int i = 0; i < n; i++) {
                parent[i] = i;
                rank[i] = 0;
            }
        }

        int find(int x) {
            if (parent[x] != x) {
                parent[x] = find(parent[x]);
            }
            return parent[x];
        }

        boolean union(int x, int y) {
            int px = find(x);
            int py = find(y);

            if (px == py) return false;

            if (rank[px] < rank[py]) {
                parent[px] = py;
            } else if (rank[px] > rank[py]) {
                parent[py] = px;
            } else {
                parent[py] = px;
                rank[px]++;
            }
            return true;
        }
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int V = sc.nextInt();
        int E = sc.nextInt();

        List<Edge> edges = new ArrayList<>();

        for (int i = 0; i < E; i++) {
            int u = sc.nextInt();
            int v = sc.nextInt();
            int w = sc.nextInt();
            edges.add(new Edge(u, v, w));
        }

        Collections.sort(edges);

        UnionFind uf = new UnionFind(V);
        int mstWeight = 0;
        int edgesUsed = 0;

        for (Edge edge : edges) {
            if (uf.union(edge.u, edge.v)) {
                mstWeight += edge.weight;
                edgesUsed++;
                if (edgesUsed == V - 1) break;
            }
        }

        System.out.println(mstWeight);
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int V = sc.nextInt();
        int E = sc.nextInt();

        List<List<Integer>> graph = new ArrayList<>();
        int[] inDegree = new int[V];

        for (int i = 0; i < V; i++) {
            graph.add(new ArrayList<>());
        }

        for (int i = 0; i < E; i++) {
            int s = sc.nextInt();
            int t = sc.nextInt();
            graph.get(s).add(t);
            inDegree[t]++;
        }

        Queue<Integer> queue = new LinkedList<>();
        for (int i = 0; i < V; i++) {
            if (inDegree[i] == 0) {
                queue.offer(i);
            }
        }

        int processedNodes = 0;
        while (!queue.isEmpty()) {
            int node = queue.poll();
            processedNodes++;

            for (int neighbor : graph.get(node)) {
                inDegree[neighbor]--;
                if (inDegree[neighbor] == 0) {
                    queue.offer(neighbor);
                }
            }
        }

        System.out.println(processedNodes == V ? 0 : 1);
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int V = sc.nextInt();
        int E = sc.nextInt();

        List<List<Integer>> graph = new ArrayList<>();
        int[] indegree = new int[V];

        for (int i = 0; i < V; i++) {
            graph.add(new ArrayList<>());
        }

        for (int i = 0; i < E; i++) {
            int s = sc.nextInt();
            int t = sc.nextInt();
            graph.get(s).add(t);
            indegree[t]++;
        }

        Queue<Integer> queue = new LinkedList<>();
        for (int i = 0; i < V; i++) {
            if (indegree[i] == 0) {
                queue.offer(i);
            }
        }

        int processed = 0;
        while (!queue.isEmpty()) {
            int node = queue.poll();
            processed++;

            for (int neighbor : graph.get(node)) {
                indegree[neighbor]--;
                if (indegree[neighbor] == 0) {
                    queue.offer(neighbor);
                }
            }
        }

        System.out.println(processed == V ? 0 : 1);
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int V = sc.nextInt();
        int E = sc.nextInt();

        List<List<Integer>> graph = new ArrayList<>();
        for (int i = 0; i < V; i++) {
            graph.add(new ArrayList<>());
        }

        for (int i = 0; i < E; i++) {
            int s = sc.nextInt();
            int t = sc.nextInt();
            graph.get(s).add(t);
        }

        int[] color = new int[V];

        for (int i = 0; i < V; i++) {
            if (color[i] == 0) {
                if (dfs(graph, i, color)) {
                    System.out.println(1);
                    return;
                }
            }
        }

        System.out.println(0);
    }

    private static boolean dfs(List<List<Integer>> graph, int node, int[] color) {
        color[node] = 1;

        for (int neighbor : graph.get(node)) {
            if (color[neighbor] == 1) {
                return true;
            }
            if (color[neighbor] == 0 && dfs(graph, neighbor, color)) {
                return true;
            }
        }

        color[node] = 2;
        return false;
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int V = sc.nextInt();
        int E = sc.nextInt();

        List<List<Integer>> graph = new ArrayList<>();
        for (int i = 0; i < V; i++) {
            graph.add(new ArrayList<>());
        }

        for (int i = 0; i < E; i++) {
            int s = sc.nextInt();
            int t = sc.nextInt();
            graph.get(s).add(t);
        }

        int[] color = new int[V];

        for (int i = 0; i < V; i++) {
            if (color[i] == 0) {
                if (dfs(graph, i, color)) {
                    System.out.println(1);
                    return;
                }
            }
        }

        System.out.println(0);
    }

    private static boolean dfs(List<List<Integer>> graph, int node, int[] color) {
        color[node] = 1;

        for (int neighbor : graph.get(node)) {
            if (color[neighbor] == 1) {
                return true;
            }
            if (color[neighbor] == 0 && dfs(graph, neighbor, color)) {
                return true;
            }
        }

        color[node] = 2;
        return false;
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int V = sc.nextInt();
        int E = sc.nextInt();

        List<List<Integer>> graph = new ArrayList<>();
        int[] inDegree = new int[V];

        for (int i = 0; i < V; i++) {
            graph.add(new ArrayList<>());
        }

        for (int i = 0; i < E; i++) {
            int s = sc.nextInt();
            int t = sc.nextInt();
            graph.get(s).add(t);
            inDegree[t]++;
        }

        Queue<Integer> queue = new LinkedList<>();
        for (int i = 0; i < V; i++) {
            if (inDegree[i] == 0) {
                queue.offer(i);
            }
        }

        while (!queue.isEmpty()) {
            int current = queue.poll();
            System.out.println(current);

            for (int neighbor : graph.get(current)) {
                inDegree[neighbor]--;
                if (inDegree[neighbor] == 0) {
                    queue.offer(neighbor);
                }
            }
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int V = sc.nextInt();
        int E = sc.nextInt();

        List<List<Integer>> adj = new ArrayList<>();
        int[] indegree = new int[V];

        for (int i = 0; i < V; i++) {
            adj.add(new ArrayList<>());
        }

        for (int i = 0; i < E; i++) {
            int s = sc.nextInt();
            int t = sc.nextInt();
            adj.get(s).add(t);
            indegree[t]++;
        }

        Queue<Integer> queue = new LinkedList<>();
        for (int i = 0; i < V; i++) {
            if (indegree[i] == 0) {
                queue.offer(i);
            }
        }

        while (!queue.isEmpty()) {
            int u = queue.poll();
            System.out.println(u);

            for (int v : adj.get(u)) {
                indegree[v]--;
                if (indegree[v] == 0) {
                    queue.offer(v);
                }
            }
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int V = sc.nextInt();
        int E = sc.nextInt();

        List<List<Integer>> graph = new ArrayList<>();
        int[] inDegree = new int[V];

        for (int i = 0; i < V; i++) {
            graph.add(new ArrayList<>());
        }

        for (int i = 0; i < E; i++) {
            int s = sc.nextInt();
            int t = sc.nextInt();
            graph.get(s).add(t);
            inDegree[t]++;
        }

        Queue<Integer> queue = new LinkedList<>();
        for (int i = 0; i < V; i++) {
            if (inDegree[i] == 0) {
                queue.offer(i);
            }
        }

        while (!queue.isEmpty()) {
            int current = queue.poll();
            System.out.println(current);

            for (int neighbor : graph.get(current)) {
                inDegree[neighbor]--;
                if (inDegree[neighbor] == 0) {
                    queue.offer(neighbor);
                }
            }
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int V = sc.nextInt();
        int E = sc.nextInt();

        List<List<Integer>> adj = new ArrayList<>();
        int[] inDegree = new int[V];

        for (int i = 0; i < V; i++) {
            adj.add(new ArrayList<>());
        }

        for (int i = 0; i < E; i++) {
            int s = sc.nextInt();
            int t = sc.nextInt();
            adj.get(s).add(t);
            inDegree[t]++;
        }

        Queue<Integer> queue = new LinkedList<>();
        for (int i = 0; i < V; i++) {
            if (inDegree[i] == 0) {
                queue.offer(i);
            }
        }

        while (!queue.isEmpty()) {
            int u = queue.poll();
            System.out.println(u);

            for (int v : adj.get(u)) {
                inDegree[v]--;
                if (inDegree[v] == 0) {
                    queue.offer(v);
                }
            }
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int V = sc.nextInt();
        int E = sc.nextInt();

        List<List<Integer>> graph = new ArrayList<>();
        int[] inDegree = new int[V];

        for (int i = 0; i < V; i++) {
            graph.add(new ArrayList<>());
        }

        for (int i = 0; i < E; i++) {
            int s = sc.nextInt();
            int t = sc.nextInt();
            graph.get(s).add(t);
            inDegree[t]++;
        }

        Queue<Integer> queue = new LinkedList<>();
        for (int i = 0; i < V; i++) {
            if (inDegree[i] == 0) {
                queue.offer(i);
            }
        }

        while (!queue.isEmpty()) {
            int current = queue.poll();
            System.out.println(current);

            for (int neighbor : graph.get(current)) {
                inDegree[neighbor]--;
                if (inDegree[neighbor] == 0) {
                    queue.offer(neighbor);
                }
            }
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    static List<Integer>[] graph;
    static int[] match;
    static boolean[] used;

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int X = sc.nextInt();
        int Y = sc.nextInt();
        int E = sc.nextInt();

        graph = new List[X];
        for (int i = 0; i < X; i++) {
            graph[i] = new ArrayList<>();
        }

        for (int i = 0; i < E; i++) {
            int x = sc.nextInt();
            int y = sc.nextInt();
            graph[x].add(y);
        }

        match = new int[Y];
        Arrays.fill(match, -1);

        int result = 0;
        for (int i = 0; i < X; i++) {
            used = new boolean[Y];
            if (dfs(i)) {
                result++;
            }
        }

        System.out.println(result);
    }

    static boolean dfs(int v) {
        for (int to : graph[v]) {
            if (used[to]) continue;
            used[to] = true;

            if (match[to] == -1 || dfs(match[to])) {
                match[to] = v;
                return true;
            }
        }
        return false;
    }
}

import java.util.*;

public class Main {
    static List<Integer>[] graph;
    static int[] match;
    static boolean[] used;

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int X = sc.nextInt();
        int Y = sc.nextInt();
        int E = sc.nextInt();

        graph = new List[X];
        for (int i = 0; i < X; i++) {
            graph[i] = new ArrayList<>();
        }

        for (int i = 0; i < E; i++) {
            int x = sc.nextInt();
            int y = sc.nextInt();
            graph[x].add(y);
        }

        match = new int[Y];
        Arrays.fill(match, -1);

        int result = 0;
        for (int i = 0; i < X; i++) {
            used = new boolean[Y];
            if (dfs(i)) {
                result++;
            }
        }

        System.out.println(result);
    }

    static boolean dfs(int v) {
        for (int to : graph[v]) {
            if (used[to]) continue;
            used[to] = true;

            if (match[to] == -1 || dfs(match[to])) {
                match[to] = v;
                return true;
            }
        }
        return false;
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        double x1 = scanner.nextDouble();
        double y1 = scanner.nextDouble();
        double x2 = scanner.nextDouble();
        double y2 = scanner.nextDouble();

        double distance = Math.sqrt((x2 - x1) * (x2 - x1) + (y2 - y1) * (y2 - y1));

        System.out.printf("%.8f%n", distance);

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        double x1 = scanner.nextDouble();
        double y1 = scanner.nextDouble();
        double x2 = scanner.nextDouble();
        double y2 = scanner.nextDouble();

        double distance = Math.sqrt((x2 - x1) * (x2 - x1) + (y2 - y1) * (y2 - y1));

        System.out.printf("%.8f%n", distance);

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        double x1 = scanner.nextDouble();
        double y1 = scanner.nextDouble();
        double x2 = scanner.nextDouble();
        double y2 = scanner.nextDouble();

        double distance = Math.sqrt((x2 - x1) * (x2 - x1) + (y2 - y1) * (y2 - y1));

        System.out.printf("%.8f%n", distance);

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        double x1 = sc.nextDouble();
        double y1 = sc.nextDouble();
        double x2 = sc.nextDouble();
        double y2 = sc.nextDouble();

        double distance = Math.sqrt((x2 - x1) * (x2 - x1) + (y2 - y1) * (y2 - y1));
        System.out.printf("%.8f\n", distance);
    }
}

import java.util.Scanner;

public class Distance {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        double x1 = sc.nextDouble();
        double y1 = sc.nextDouble();
        double x2 = sc.nextDouble();
        double y2 = sc.nextDouble();

        double dist = Math.sqrt((x2 - x1)*(x2 - x1) + (y2 - y1)*(y2 - y1));
        System.out.printf("%.8f\n", dist);
    }
}

import java.util.Scanner;

public class Distance {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        double x1 = sc.nextDouble();
        double y1 = sc.nextDouble();
        double x2 = sc.nextDouble();
        double y2 = sc.nextDouble();
        double dist = Math.sqrt((x1 - x2)*(x1 - x2) + (y1 - y2)*(y1 - y2));
        System.out.printf("%.8f\n", dist);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        double x1 = scanner.nextDouble();
        double y1 = scanner.nextDouble();
        double x2 = scanner.nextDouble();
        double y2 = scanner.nextDouble();

        double distance = Math.sqrt(Math.pow(x2 - x1, 2) + Math.pow(y2 - y1, 2));
        System.out.printf("%.8f%n", distance);

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        double x1 = sc.nextDouble();
        double y1 = sc.nextDouble();
        double x2 = sc.nextDouble();
        double y2 = sc.nextDouble();

        double distance = Math.sqrt(Math.pow(x2 - x1, 2) + Math.pow(y2 - y1, 2));

        System.out.printf("%.8f\n", distance);

        sc.close();
    }
}

import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        double x1 = sc.nextDouble();
        double y1 = sc.nextDouble();
        double x2 = sc.nextDouble();
        double y2 = sc.nextDouble();

        double distance = Math.sqrt(Math.pow(x2 - x1, 2) + Math.pow(y2 - y1, 2));

        System.out.printf("%.8f\n", distance);

        sc.close();
    }
}

import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        double x1 = sc.nextDouble();
        double y1 = sc.nextDouble();
        double x2 = sc.nextDouble();
        double y2 = sc.nextDouble();

        double distance = Math.sqrt(Math.pow(x2 - x1, 2) + Math.pow(y2 - y1, 2));

        System.out.printf("%.8f\n", distance);

        sc.close();
    }
}

import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        double x1 = sc.nextDouble();
        double y1 = sc.nextDouble();
        double x2 = sc.nextDouble();
        double y2 = sc.nextDouble();

        double distance = Math.sqrt(Math.pow(x2 - x1, 2) + Math.pow(y2 - y1, 2));

        System.out.printf("%.8f\n", distance);

        sc.close();
    }
}

import java.util.Scanner;

public class Triangle {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        double a = sc.nextDouble();
        double b = sc.nextDouble();
        double C = sc.nextDouble();

        double radC = Math.toRadians(C);

        double S = 0.5 * a * b * Math.sin(radC);

        double c = Math.sqrt(a * a + b * b - 2 * a * b * Math.cos(radC));

        double L = a + b + c;

        double h = 2 * S / a;

        System.out.printf("%.8f\n", S);
        System.out.printf("%.8f\n", L);
        System.out.printf("%.8f\n", h);
    }
}

import java.util.Scanner;

public class Triangle {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        double a = sc.nextDouble();
        double b = sc.nextDouble();
        double C = sc.nextDouble();

        double C_rad = Math.toRadians(C);

        double S = 0.5 * a * b * Math.sin(C_rad);

        double c = Math.sqrt(a * a + b * b - 2 * a * b * Math.cos(C_rad));

        double L = a + b + c;

        double h = 2 * S / a;

        System.out.printf("%.8f\n", S);
        System.out.printf("%.8f\n", L);
        System.out.printf("%.8f\n", h);
    }
}

import java.util.Scanner;

public class Triangle {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        double a = sc.nextDouble();
        double b = sc.nextDouble();
        double C = sc.nextDouble();

        double C_rad = Math.toRadians(C);

        double S = 0.5 * a * b * Math.sin(C_rad);

        double c = Math.sqrt(a * a + b * b - 2 * a * b * Math.cos(C_rad));

        double L = a + b + c;

        double h = 2 * S / a;

        System.out.printf("%.8f\n", S);
        System.out.printf("%.8f\n", L);
        System.out.printf("%.8f\n", h);
    }
}

import java.util.Scanner;

public class Triangle {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        double a = sc.nextDouble();
        double b = sc.nextDouble();
        double C = sc.nextDouble();

        double radians = Math.toRadians(C);

        double S = 0.5 * a * b * Math.sin(radians);

        double c = Math.sqrt(a * a + b * b - 2 * a * b * Math.cos(radians));

        double L = a + b + c;

        double h = 2 * S / a;

        System.out.printf("%.8f%n", S);
        System.out.printf("%.8f%n", L);
        System.out.printf("%.8f%n", h);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            if (n == 0) break;

            int[] scores = new int[n];
            int sum = 0;

            for (int i = 0; i < n; i++) {
                scores[i] = sc.nextInt();
                sum += scores[i];
            }

            double mean = (double) sum / n;

            double variance = 0;
            for (int i = 0; i < n; i++) {
                variance += (scores[i] - mean) * (scores[i] - mean);
            }
            variance /= n;

            double standardDeviation = Math.sqrt(variance);

            System.out.printf("%.8f%n", standardDeviation);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            if (n == 0) break;

            int[] scores = new int[n];
            int sum = 0;

            for (int i = 0; i < n; i++) {
                scores[i] = sc.nextInt();
                sum += scores[i];
            }

            double mean = (double) sum / n;
            double variance = 0;

            for (int i = 0; i < n; i++) {
                variance += (scores[i] - mean) * (scores[i] - mean);
            }

            variance /= n;
            double standardDeviation = Math.sqrt(variance);

            System.out.printf("%.8f%n", standardDeviation);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        int[] x = new int[n];
        int[] y = new int[n];

        for (int i = 0; i < n; i++) {
            x[i] = sc.nextInt();
        }

        for (int i = 0; i < n; i++) {
            y[i] = sc.nextInt();
        }

        double sum1 = 0;
        for (int i = 0; i < n; i++) {
            sum1 += Math.abs(x[i] - y[i]);
        }
        System.out.printf("%.6f\n", sum1);

        double sum2 = 0;
        for (int i = 0; i < n; i++) {
            sum2 += Math.pow(Math.abs(x[i] - y[i]), 2);
        }
        System.out.printf("%.6f\n", Math.pow(sum2, 1.0/2));

        double sum3 = 0;
        for (int i = 0; i < n; i++) {
            sum3 += Math.pow(Math.abs(x[i] - y[i]), 3);
        }
        System.out.printf("%.6f\n", Math.pow(sum3, 1.0/3));

        double maxDiff = 0;
        for (int i = 0; i < n; i++) {
            maxDiff = Math.max(maxDiff, Math.abs(x[i] - y[i]));
        }
        System.out.printf("%.6f\n", maxDiff);

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        int[] x = new int[n];
        int[] y = new int[n];

        for (int i = 0; i < n; i++) {
            x[i] = sc.nextInt();
        }

        for (int i = 0; i < n; i++) {
            y[i] = sc.nextInt();
        }

        double sum1 = 0;
        for (int i = 0; i < n; i++) {
            sum1 += Math.abs(x[i] - y[i]);
        }
        System.out.printf("%.6f%n", sum1);

        double sum2 = 0;
        for (int i = 0; i < n; i++) {
            sum2 += Math.pow(Math.abs(x[i] - y[i]), 2);
        }
        System.out.printf("%.6f%n", Math.pow(sum2, 1.0/2));

        double sum3 = 0;
        for (int i = 0; i < n; i++) {
            sum3 += Math.pow(Math.abs(x[i] - y[i]), 3);
        }
        System.out.printf("%.6f%n", Math.pow(sum3, 1.0/3));

        double max = 0;
        for (int i = 0; i < n; i++) {
            max = Math.max(max, Math.abs(x[i] - y[i]));
        }
        System.out.printf("%.6f%n", max);

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        int[] x = new int[n];
        int[] y = new int[n];

        for (int i = 0; i < n; i++) {
            x[i] = sc.nextInt();
        }

        for (int i = 0; i < n; i++) {
            y[i] = sc.nextInt();
        }

        double sum1 = 0;
        for (int i = 0; i < n; i++) {
            sum1 += Math.abs(x[i] - y[i]);
        }
        System.out.printf("%.6f\n", sum1);

        double sum2 = 0;
        for (int i = 0; i < n; i++) {
            sum2 += Math.pow(Math.abs(x[i] - y[i]), 2);
        }
        System.out.printf("%.6f\n", Math.pow(sum2, 1.0/2));

        double sum3 = 0;
        for (int i = 0; i < n; i++) {
            sum3 += Math.pow(Math.abs(x[i] - y[i]), 3);
        }
        System.out.printf("%.6f\n", Math.pow(sum3, 1.0/3));

        double max = 0;
        for (int i = 0; i < n; i++) {
            max = Math.max(max, Math.abs(x[i] - y[i]));
        }
        System.out.printf("%.6f\n", max);

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int[] dice = new int[6];
        for (int i = 0; i < 6; i++) {
            dice[i] = sc.nextInt();
        }

        int q = sc.nextInt();

        int[][] orientations = {
            {0, 2, 5, 4, 3, 1},
            {0, 3, 2, 5, 4, 1},
            {0, 4, 3, 2, 5, 1},
            {0, 5, 4, 3, 2, 1},
            {1, 2, 4, 5, 3, 0},
            {1, 3, 5, 4, 2, 0},
            {1, 4, 2, 3, 5, 0},
            {1, 5, 3, 2, 4, 0},
            {2, 0, 5, 4, 1, 3},
            {2, 1, 4, 5, 0, 3},
            {2, 4, 0, 1, 5, 3},
            {2, 5, 1, 0, 4, 3},
            {3, 0, 4, 5, 1, 2},
            {3, 1, 5, 4, 0, 2},
            {3, 4, 1, 0, 5, 2},
            {3, 5, 0, 1, 4, 2},
            {4, 0, 2, 3, 1, 5},
            {4, 1, 3, 2, 0, 5},
            {4, 2, 1, 0, 3, 5},
            {4, 3, 0, 1, 2, 5},
            {5, 0, 3, 2, 1, 4},
            {5, 1, 2, 3, 0, 4},
            {5, 2, 0, 1, 3, 4},
            {5, 3, 1, 0, 2, 4}
        };

        for (int i = 0; i < q; i++) {
            int top = sc.nextInt();
            int front = sc.nextInt();

            for (int[] orientation : orientations) {
                if (dice[orientation[0]] == top && dice[orientation[1]] == front) {
                    System.out.println(dice[orientation[2]]);
                    break;
                }
            }
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int[] dice = new int[6];
        for (int i = 0; i < 6; i++) {
            dice[i] = sc.nextInt();
        }

        int q = sc.nextInt();

        int[][] orientations = {
            {0, 1, 2, 3, 4, 5},
            {0, 2, 4, 1, 3, 5},
            {0, 3, 1, 4, 2, 5},
            {0, 4, 3, 2, 1, 5},
            {1, 0, 3, 2, 5, 4},
            {1, 2, 0, 5, 3, 4},
            {1, 3, 5, 0, 2, 4},
            {1, 5, 2, 3, 0, 4},
            {2, 0, 4, 1, 5, 3},
            {2, 1, 0, 5, 4, 3},
            {2, 4, 5, 0, 1, 3},
            {2, 5, 1, 4, 0, 3},
            {3, 0, 1, 4, 5, 2},
            {3, 1, 5, 0, 4, 2},
            {3, 4, 0, 5, 1, 2},
            {3, 5, 4, 1, 0, 2},
            {4, 0, 2, 3, 5, 1},
            {4, 2, 5, 0, 3, 1},
            {4, 3, 0, 5, 2, 1},
            {4, 5, 3, 2, 0, 1},
            {5, 1, 3, 2, 4, 0},
            {5, 2, 1, 4, 3, 0},
            {5, 3, 4, 1, 2, 0},
            {5, 4, 2, 3, 1, 0}
        };

        for (int i = 0; i < q; i++) {
            int top = sc.nextInt();
            int front = sc.nextInt();

            for (int[] orientation : orientations) {
                if (dice[orientation[0]] == top && dice[orientation[1]] == front) {
                    System.out.println(dice[orientation[2]]);
                    break;
                }
            }
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int[] dice = new int[6];
        for (int i = 0; i < 6; i++) {
            dice[i] = sc.nextInt();
        }

        int q = sc.nextInt();

        int[][] orientations = {
            {0, 1, 2, 3, 4, 5},
            {0, 2, 4, 1, 3, 5},
            {0, 3, 1, 4, 2, 5},
            {0, 4, 3, 2, 1, 5},
            {1, 0, 3, 2, 5, 4},
            {1, 2, 0, 5, 3, 4},
            {1, 3, 5, 0, 2, 4},
            {1, 5, 2, 3, 0, 4},
            {2, 0, 4, 1, 5, 3},
            {2, 1, 0, 5, 4, 3},
            {2, 4, 5, 0, 1, 3},
            {2, 5, 1, 4, 0, 3},
            {3, 0, 1, 4, 5, 2},
            {3, 1, 5, 0, 4, 2},
            {3, 4, 0, 5, 1, 2},
            {3, 5, 4, 1, 0, 2},
            {4, 0, 2, 3, 5, 1},
            {4, 2, 5, 0, 3, 1},
            {4, 3, 0, 5, 2, 1},
            {4, 5, 3, 2, 0, 1},
            {5, 1, 3, 2, 4, 0},
            {5, 2, 1, 4, 3, 0},
            {5, 3, 4, 1, 2, 0},
            {5, 4, 2, 3, 1, 0}
        };

        for (int i = 0; i < q; i++) {
            int top = sc.nextInt();
            int front = sc.nextInt();

            for (int[] orientation : orientations) {
                if (dice[orientation[0]] == top && dice[orientation[1]] == front) {
                    System.out.println(dice[orientation[2]]);
                    break;
                }
            }
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int[] dice1 = new int[6];
        int[] dice2 = new int[6];

        for (int i = 0; i < 6; i++) {
            dice1[i] = sc.nextInt();
        }
        for (int i = 0; i < 6; i++) {
            dice2[i] = sc.nextInt();
        }

        if (areIdentical(dice1, dice2)) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
    }

    static boolean areIdentical(int[] d1, int[] d2) {
        int[][] orientations = {
            {0,1,2,3,4,5}, {0,2,4,1,3,5}, {0,4,3,2,1,5}, {0,3,1,4,2,5},
            {1,0,3,2,5,4}, {1,3,5,0,2,4}, {1,5,2,3,0,4}, {1,2,0,5,3,4},
            {2,0,1,4,5,3}, {2,1,5,0,4,3}, {2,5,4,1,0,3}, {2,4,0,5,1,3},
            {3,0,4,1,5,2}, {3,4,5,0,1,2}, {3,5,1,4,0,2}, {3,1,0,5,4,2},
            {4,0,2,3,5,1}, {4,2,5,0,3,1}, {4,5,3,2,0,1}, {4,3,0,5,2,1},
            {5,1,3,2,4,0}, {5,3,4,1,2,0}, {5,4,2,3,1,0}, {5,2,1,4,3,0}
        };

        for (int[] orientation : orientations) {
            boolean match = true;
            for (int i = 0; i < 6; i++) {
                if (d1[i] != d2[orientation[i]]) {
                    match = false;
                    break;
                }
            }
            if (match) return true;
        }
        return false;
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int[] dice1 = new int[6];
        int[] dice2 = new int[6];

        for (int i = 0; i < 6; i++) {
            dice1[i] = sc.nextInt();
        }

        for (int i = 0; i < 6; i++) {
            dice2[i] = sc.nextInt();
        }

        if (areIdentical(dice1, dice2)) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
    }

    static boolean areIdentical(int[] d1, int[] d2) {
        int[][] orientations = {
            {0, 1, 2, 3, 4, 5},
            {0, 2, 4, 1, 3, 5},
            {0, 4, 3, 2, 1, 5},
            {0, 3, 1, 4, 2, 5},

            {1, 5, 2, 0, 4, 3},
            {1, 2, 4, 5, 0, 3},
            {1, 4, 0, 2, 5, 3},
            {1, 0, 5, 4, 2, 3},

            {2, 1, 5, 3, 0, 4},
            {2, 5, 0, 1, 3, 4},
            {2, 0, 3, 5, 1, 4},
            {2, 3, 1, 0, 5, 4},

            {3, 1, 0, 4, 5, 2},
            {3, 0, 4, 1, 2, 5},
            {3, 4, 5, 0, 1, 2},
            {3, 5, 1, 4, 0, 2},

            {4, 1, 3, 2, 5, 0},
            {4, 3, 5, 1, 0, 2},
            {4, 5, 2, 3, 1, 0},
            {4, 2, 0, 5, 3, 0},

            {5, 1, 4, 2, 0, 3},
            {5, 4, 0, 1, 2, 3},
            {5, 0, 2, 4, 1, 3},
            {5, 2, 1, 0, 4, 3}
        };

        for (int[] orientation : orientations) {
            boolean match = true;
            for (int i = 0; i < 6; i++) {
                if (d1[i] != d2[orientation[i]]) {
                    match = false;
                    break;
                }
            }
            if (match) return true;
        }

        return false;
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int x = scanner.nextInt();
        int cube = x * x * x;
        System.out.println(cube);
        scanner.close();
    }
}

import java.util.Scanner;

public class Main {

  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    int x = sc.nextInt();
    int result = x * x * x;
    System.out.println(result);
    sc.close();
  }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int x = sc.nextInt();
        int result = x * x * x;
        System.out.println(result);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();

        int result = N * N * N;

        System.out.println(result);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int x = scanner.nextInt();
        int cube = x * x * x;
        System.out.println(cube);
        scanner.close();
    }
}

import java.util.Scanner;

public class Rectangle {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int a = scanner.nextInt();
        int b = scanner.nextInt();

        int area = a * b;
        int perimeter = 2 * (a + b);

        System.out.println(area + " " + perimeter);
        scanner.close();
    }
}

import java.util.Scanner;

public class Main {

  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    int a = sc.nextInt();
    int b = sc.nextInt();

    int area = a * b;
    int perimeter = 2 * (a + b);

    System.out.println(area + " " + perimeter);

    sc.close();
  }
}

import java.util.Scanner;

public class Main {

  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    int a = sc.nextInt();
    int b = sc.nextInt();

    int area = a * b;
    int perimeter = 2 * (a + b);

    System.out.println(area + " " + perimeter);

    sc.close();
  }
}

import java.util.Scanner;

public class Rectangle {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int a = scanner.nextInt();
        int b = scanner.nextInt();

        int area = a * b;
        int perimeter = 2 * (a + b);

        System.out.println(area + " " + perimeter);
        scanner.close();
    }
}

import java.util.Scanner;

public class Rectangle {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int a = scanner.nextInt();
        int b = scanner.nextInt();

        int area = a * b;
        int perimeter = 2 * (a + b);

        System.out.println(area + " " + perimeter);
    }
}

import java.util.Scanner;

public class Rectangle {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int a = sc.nextInt();
        int b = sc.nextInt();
        int area = a * b;
        int perimeter = 2 * (a + b);
        System.out.println(area + " " + perimeter);
    }
}

import java.util.Scanner;

public class Rectangle {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int a = sc.nextInt();
        int b = sc.nextInt();
        int area = a * b;
        int perimeter = 2 * (a + b);
        System.out.println(area + " " + perimeter);
    }
}

import java.util.Scanner;

public class Rectangle {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int a = sc.nextInt();
        int b = sc.nextInt();
        int area = a * b;
        int perimeter = 2 * (a + b);
        System.out.println(area + " " + perimeter);
    }
}

import java.util.Scanner;

public class Rectangle {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int a = sc.nextInt();
        int b = sc.nextInt();
        int area = a * b;
        int perimeter = 2 * (a + b);
        System.out.println(area + " " + perimeter);
    }
}

import java.util.Scanner;

public class Rectangle {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int a = scanner.nextInt();
        int b = scanner.nextInt();

        int area = a * b;
        int perimeter = 2 * (a + b);

        System.out.println(area + " " + perimeter);
    }
}

import java.util.Scanner;

public class Rectangle {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int a = sc.nextInt();
        int b = sc.nextInt();
        int area = a * b;
        int perimeter = 2 * (a + b);
        System.out.println(area + " " + perimeter);
    }
}

import java.util.Scanner;

public class Rectangle {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int a = scanner.nextInt();
        int b = scanner.nextInt();
        int area = a * b;
        int perimeter = 2 * (a + b);
        System.out.println(area + " " + perimeter);
    }
}

import java.util.Scanner;

public class Rectangle {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int a = scanner.nextInt();
        int b = scanner.nextInt();
        int area = a * b;
        int perimeter = 2 * (a + b);
        System.out.println(area + " " + perimeter);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int S = sc.nextInt();

        int hours = S / 3600;
        int minutes = (S % 3600) / 60;
        int seconds = S % 60;

        System.out.println(hours + ":" + minutes + ":" + seconds);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int S = sc.nextInt();

        int h = S / 3600;
        int m = (S % 3600) / 60;
        int s = S % 60;

        System.out.println(h + ":" + m + ":" + s);

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int S = scanner.nextInt();

        int hours = S / 3600;
        int minutes = (S % 3600) / 60;
        int seconds = S % 60;

        System.out.println(hours + ":" + minutes + ":" + seconds);
        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int S = sc.nextInt();

        int h = S / 3600;
        int m = (S % 3600) / 60;
        int s = S % 60;

        System.out.println(h + ":" + m + ":" + s);

        sc.close();
    }
}

import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int S = sc.nextInt();

        int h = S / 3600;
        int m = (S % 3600) / 60;
        int s = S % 60;

        System.out.println(h + ":" + m + ":" + s);

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int S = sc.nextInt();

        int hours = S / 3600;
        int minutes = (S % 3600) / 60;
        int seconds = S % 60;

        System.out.println(hours + ":" + minutes + ":" + seconds);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int S = scanner.nextInt();

        int hours = S / 3600;
        int minutes = (S % 3600) / 60;
        int seconds = S % 60;

        System.out.println(hours + ":" + minutes + ":" + seconds);
        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int S = sc.nextInt();

        int h = S / 3600;
        int m = (S % 3600) / 60;
        int s = S % 60;

        System.out.println(h + ":" + m + ":" + s);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int a = scanner.nextInt();
        int b = scanner.nextInt();

        if (a < b) {
            System.out.println("a < b");
        } else if (a > b) {
            System.out.println("a > b");
        } else {
            System.out.println("a == b");
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int a = scanner.nextInt();
        int b = scanner.nextInt();

        if (a < b) {
            System.out.println("a < b");
        } else if (a > b) {
            System.out.println("a > b");
        } else {
            System.out.println("a == b");
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int a = scanner.nextInt();
        int b = scanner.nextInt();

        if (a < b) {
            System.out.println("a < b");
        } else if (a > b) {
            System.out.println("a > b");
        } else {
            System.out.println("a == b");
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int a = sc.nextInt();
        int b = sc.nextInt();

        if (a < b) {
            System.out.println("a < b");
        } else if (a > b) {
            System.out.println("a > b");
        } else {
            System.out.println("a == b");
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {

  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    int a = sc.nextInt();
    int b = sc.nextInt();

    if (a < b) {
      System.out.println("a < b");
    } else if (a > b) {
      System.out.println("a > b");
    } else {
      System.out.println("a == b");
    }
    sc.close();
  }
}

import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int a = sc.nextInt();
        int b = sc.nextInt();

        if (a < b) {
            System.out.println("a < b");
        } else if (a > b) {
            System.out.println("a > b");
        } else {
            System.out.println("a == b");
        }
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int a = sc.nextInt();
        int b = sc.nextInt();

        if (a < b) {
            System.out.println("a < b");
        } else if (a > b) {
            System.out.println("a > b");
        } else {
            System.out.println("a == b");
        }
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int a = scanner.nextInt();
        int b = scanner.nextInt();
        int c = scanner.nextInt();

        if (a < b && b < c) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {

  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    int a = sc.nextInt();
    int b = sc.nextInt();
    int c = sc.nextInt();

    if (a < b && b < c) {
      System.out.println("Yes");
    } else {
      System.out.println("No");
    }

    sc.close();
  }
}

import java.util.Scanner;

public class Main {

  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    int a = sc.nextInt();
    int b = sc.nextInt();
    int c = sc.nextInt();

    if (a < b && b < c) {
      System.out.println("Yes");
    } else {
      System.out.println("No");
    }

    sc.close();
  }
}

import java.util.Scanner;

public class Main {

  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    int a = sc.nextInt();
    int b = sc.nextInt();
    int c = sc.nextInt();

    if (a < b && b < c) {
      System.out.println("Yes");
    } else {
      System.out.println("No");
    }

    sc.close();
  }
}

import java.util.Scanner;

public class Main {

  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    int a = sc.nextInt();
    int b = sc.nextInt();
    int c = sc.nextInt();

    if (a < b && b < c) {
      System.out.println("Yes");
    } else {
      System.out.println("No");
    }

    sc.close();
  }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int a = scanner.nextInt();
        int b = scanner.nextInt();
        int c = scanner.nextInt();

        if (a < b && b < c) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int a = sc.nextInt();
        int b = sc.nextInt();
        int c = sc.nextInt();

        System.out.println((a < b && b < c) ? "Yes" : "No");
    }
}

import java.util.Scanner;

public class Range {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int a = scanner.nextInt();
        int b = scanner.nextInt();
        int c = scanner.nextInt();
        System.out.println((a < b && b < c) ? "Yes" : "No");
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int a = sc.nextInt();
        int b = sc.nextInt();
        int c = sc.nextInt();

        int min = Math.min(Math.min(a, b), c);
        int max = Math.max(Math.max(a, b), c);
        int mid = a + b + c - min - max;

        System.out.println(min + " " + mid + " " + max);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int a = scanner.nextInt();
        int b = scanner.nextInt();
        int c = scanner.nextInt();

        int min = Math.min(Math.min(a, b), c);
        int max = Math.max(Math.max(a, b), c);
        int mid = a + b + c - min - max;

        System.out.println(min + " " + mid + " " + max);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int a = sc.nextInt();
        int b = sc.nextInt();
        int c = sc.nextInt();

        int min = Math.min(Math.min(a, b), c);
        int max = Math.max(Math.max(a, b), c);
        int mid = a + b + c - min - max;

        System.out.println(min + " " + mid + " " + max);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int a = sc.nextInt();
        int b = sc.nextInt();
        int c = sc.nextInt();

        int min = Math.min(Math.min(a, b), c);
        int max = Math.max(Math.max(a, b), c);
        int middle = a + b + c - min - max;

        System.out.println(min + " " + middle + " " + max);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int W = sc.nextInt();
        int H = sc.nextInt();
        int x = sc.nextInt();
        int y = sc.nextInt();
        int r = sc.nextInt();

        if (x - r >= 0 && x + r <= W && y - r >= 0 && y + r <= H) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int W = scanner.nextInt();
        int H = scanner.nextInt();
        int x = scanner.nextInt();
        int y = scanner.nextInt();
        int r = scanner.nextInt();

        if (x - r >= 0 && x + r <= W && y - r >= 0 && y + r <= H) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int W = scanner.nextInt();
        int H = scanner.nextInt();
        int x = scanner.nextInt();
        int y = scanner.nextInt();
        int r = scanner.nextInt();

        if (x - r >= 0 && x + r <= W && y - r >= 0 && y + r <= H) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int W = scanner.nextInt();
        int H = scanner.nextInt();
        int x = scanner.nextInt();
        int y = scanner.nextInt();
        int r = scanner.nextInt();

        if (x - r >= 0 && x + r <= W && y - r >= 0 && y + r <= H) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int W = scanner.nextInt();
        int H = scanner.nextInt();
        int x = scanner.nextInt();
        int y = scanner.nextInt();
        int r = scanner.nextInt();

        if (x - r >= 0 && x + r <= W && y - r >= 0 && y + r <= H) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int W = sc.nextInt();
        int H = sc.nextInt();
        int x = sc.nextInt();
        int y = sc.nextInt();
        int r = sc.nextInt();

        if (x - r >= 0 && x + r <= W && y - r >= 0 && y + r <= H) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int W = sc.nextInt();
        int H = sc.nextInt();
        int x = sc.nextInt();
        int y = sc.nextInt();
        int r = sc.nextInt();

        if (x - r >= 0 && x + r <= W && y - r >= 0 && y + r <= H) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int W = sc.nextInt();
        int H = sc.nextInt();
        int x = sc.nextInt();
        int y = sc.nextInt();
        int r = sc.nextInt();

        if (x - r >= 0 && x + r <= W && y - r >= 0 && y + r <= H) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
    }
}

import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int W = sc.nextInt();
        int H = sc.nextInt();
        int x = sc.nextInt();
        int y = sc.nextInt();
        int r = sc.nextInt();

        if (x - r >= 0 && x + r <= W && y - r >= 0 && y + r <= H) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int W = sc.nextInt();
        int H = sc.nextInt();
        int x = sc.nextInt();
        int y = sc.nextInt();
        int r = sc.nextInt();

        if (x - r >= 0 && x + r <= W && y - r >= 0 && y + r <= H) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int W = sc.nextInt();
        int H = sc.nextInt();
        int x = sc.nextInt();
        int y = sc.nextInt();
        int r = sc.nextInt();

        if (x - r >= 0 && x + r <= W && y - r >= 0 && y + r <= H) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int W = sc.nextInt();
        int H = sc.nextInt();
        int x = sc.nextInt();
        int y = sc.nextInt();
        int r = sc.nextInt();

        if (x - r >= 0 && x + r <= W && y - r >= 0 && y + r <= H) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int W = sc.nextInt();
        int H = sc.nextInt();
        int x = sc.nextInt();
        int y = sc.nextInt();
        int r = sc.nextInt();

        if (x - r >= 0 && x + r <= W && y - r >= 0 && y + r <= H) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int W = sc.nextInt();
        int H = sc.nextInt();
        int x = sc.nextInt();
        int y = sc.nextInt();
        int r = sc.nextInt();

        if (x - r >= 0 && x + r <= W && y - r >= 0 && y + r <= H) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int caseNumber = 1;

        while (true) {
            int x = scanner.nextInt();
            if (x == 0) {
                break;
            }
            System.out.println("Case " + caseNumber + ": " + x);
            caseNumber++;
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int i = 1;
        while (true) {
            int x = sc.nextInt();
            if (x == 0) {
                break;
            }
            System.out.println("Case " + i + ": " + x);
            i++;
        }
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int caseNumber = 1;

        while (true) {
            int x = scanner.nextInt();
            if (x == 0) {
                break;
            }
            System.out.println("Case " + caseNumber + ": " + x);
            caseNumber++;
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int caseNumber = 1;

        while (true) {
            int x = scanner.nextInt();
            if (x == 0) {
                break;
            }
            System.out.println("Case " + caseNumber + ": " + x);
            caseNumber++;
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int i = 1;
        while (true) {
            int x = sc.nextInt();
            if (x == 0) {
                break;
            }
            System.out.println("Case " + i + ": " + x);
            i++;
        }
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int i = 1;
        while (true) {
            int x = sc.nextInt();
            if (x == 0) {
                break;
            }
            System.out.println("Case " + i + ": " + x);
            i++;
        }
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int caseNumber = 1;

        while (true) {
            int x = scanner.nextInt();
            if (x == 0) break;
            System.out.println("Case " + caseNumber + ": " + x);
            caseNumber++;
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int caseNumber = 1;

        while (true) {
            int x = scanner.nextInt();
            if (x == 0) break;
            System.out.println("Case " + caseNumber + ": " + x);
            caseNumber++;
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        while (true) {
            int x = scanner.nextInt();
            int y = scanner.nextInt();

            if (x == 0 && y == 0) {
                break;
            }

            if (x <= y) {
                System.out.println(x + " " + y);
            } else {
                System.out.println(y + " " + x);
            }
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        while (true) {
            int x = scanner.nextInt();
            int y = scanner.nextInt();

            if (x == 0 && y == 0) {
                break;
            }

            if (x <= y) {
                System.out.println(x + " " + y);
            } else {
                System.out.println(y + " " + x);
            }
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int x = sc.nextInt();
            int y = sc.nextInt();

            if (x == 0 && y == 0) {
                break;
            }

            if (x <= y) {
                System.out.println(x + " " + y);
            } else {
                System.out.println(y + " " + x);
            }
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        while (true) {
            int x = scanner.nextInt();
            int y = scanner.nextInt();

            if (x == 0 && y == 0) {
                break;
            }

            if (x <= y) {
                System.out.println(x + " " + y);
            } else {
                System.out.println(y + " " + x);
            }
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int a = sc.nextInt();
        int b = sc.nextInt();
        int c = sc.nextInt();

        int count = 0;

        for (int i = 1; i * i <= c; i++) {
            if (c % i == 0) {
                if (i >= a && i <= b) {
                    count++;
                }

                int complement = c / i;
                if (complement != i && complement >= a && complement <= b) {
                    count++;
                }
            }
        }

        System.out.println(count);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int a = scanner.nextInt();
        int b = scanner.nextInt();
        int c = scanner.nextInt();

        int count = 0;
        for (int i = 1; i * i <= c; i++) {
            if (c % i == 0) {
                if (i >= a && i <= b) {
                    count++;
                }
                int pair = c / i;
                if (pair != i && pair >= a && pair <= b) {
                    count++;
                }
            }
        }
        System.out.println(count);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int a = sc.nextInt();
        int b = sc.nextInt();
        int c = sc.nextInt();

        int count = 0;

        for (int i = 1; i * i <= c; i++) {
            if (c % i == 0) {
                if (i >= a && i <= b) {
                    count++;
                }

                int paired = c / i;
                if (paired != i && paired >= a && paired <= b) {
                    count++;
                }
            }
        }

        System.out.println(count);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int a = sc.nextInt();
        int b = sc.nextInt();
        int c = sc.nextInt();

        int count = 0;
        for (int i = 1; i * i <= c; i++) {
            if (c % i == 0) {
                if (i >= a && i <= b) {
                    count++;
                }
                int complement = c / i;
                if (complement != i && complement >= a && complement <= b) {
                    count++;
                }
            }
        }

        System.out.println(count);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int a = scanner.nextInt();
        int b = scanner.nextInt();
        int c = scanner.nextInt();

        int count = 0;
        for (int i = a; i <= b; i++) {
            if (c % i == 0) {
                count++;
            }
        }

        System.out.println(count);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int L = scanner.nextInt();
        int R = scanner.nextInt();
        int d = scanner.nextInt();

        int count = 0;
        for (int i = L; i <= R; i++) {
            if (i % d == 0) {
                count++;
            }
        }
        System.out.println(count);
    }
}

import java.util.Scanner;

public class Main {

  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    int a = sc.nextInt();
    int b = sc.nextInt();
    int c = sc.nextInt();
    int count = 0;
    for (int i = a; i <= b; i++) {
      if (c % i == 0) {
        count++;
      }
    }
    System.out.println(count);
  }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int a = sc.nextInt();
        int b = sc.nextInt();
        int c = sc.nextInt();
        int count = 0;
        for (int i = a; i <= b; i++) {
            if (c % i == 0) {
                count++;
            }
        }
        System.out.println(count);
    }
}

import java.util.Scanner;

public class Main {

  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    int a = sc.nextInt();
    int b = sc.nextInt();
    int c = sc.nextInt();
    int count = 0;
    for (int i = a; i <= b; i++) {
      if (c % i == 0) {
        count++;
      }
    }
    System.out.println(count);
  }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int L = sc.nextInt();
        int R = sc.nextInt();
        int d = sc.nextInt();

        int count = 0;
        for (int i = L; i <= R; i++) {
            if (i % d == 0) {
                count++;
            }
        }

        System.out.println(count);
    }
}

import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int a = scanner.nextInt();
        int b = scanner.nextInt();
        int c = scanner.nextInt();

        int count = 0;
        for (int i = a; i <= b; i++) {
            if (c % i == 0) {
                count++;
            }
        }
        System.out.println(count);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int L = sc.nextInt();
        int R = sc.nextInt();
        int d = sc.nextInt();

        int count = 0;
        for (int i = L; i <= R; i++) {
            if (i % d == 0) {
                count++;
            }
        }

        System.out.println(count);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int a = sc.nextInt();
        int b = sc.nextInt();
        int c = sc.nextInt();

        int count = 0;
        for (int i = a; i <= b; i++) {
            if (c % i == 0) {
                count++;
            }
        }

        System.out.println(count);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int L = sc.nextInt();
        int R = sc.nextInt();
        int d = sc.nextInt();
        int count = 0;
        for (int i = L; i <= R; i++) {
            if (i % d == 0) {
                count++;
            }
        }
        System.out.println(count);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int L = scanner.nextInt();
        int R = scanner.nextInt();
        int d = scanner.nextInt();

        int count = 0;
        for (int i = L; i <= R; i++) {
            if (i % d == 0) {
                count++;
            }
        }
        System.out.println(count);
    }
}

import java.util.Scanner;

public class Divisors {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int a = scanner.nextInt();
        int b = scanner.nextInt();
        int c = scanner.nextInt();

        int count = 0;

        for (int i = a; i <= b; i++) {
            if (c % i == 0) {
                count++;
            }
        }

        System.out.println(count);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int a = scanner.nextInt();
        int b = scanner.nextInt();
        int c = scanner.nextInt();

        int count = 0;
        for (int i = a; i <= b; i++) {
            if (c % i == 0) {
                count++;
            }
        }
        System.out.println(count);
    }
}

import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int a = sc.nextInt();
        int b = sc.nextInt();
        int c = sc.nextInt();
        int count = 0;
        for (int i = a; i <= b; i++) {
            if (c % i == 0) {
                count++;
            }
        }
        System.out.println(count);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int L = scanner.nextInt();
        int R = scanner.nextInt();
        int d = scanner.nextInt();

        int count = 0;
        for (int i = L; i <= R; i++) {
            if (i % d == 0) {
                count++;
            }
        }
        System.out.println(count);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int L = sc.nextInt();
        int R = sc.nextInt();
        int d = sc.nextInt();

        int count = 0;
        for (int i = L; i <= R; i++) {
            if (i % d == 0) {
                count++;
            }
        }

        System.out.println(count);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int a = scanner.nextInt();
        int b = scanner.nextInt();

        int d = a / b;
        int r = a % b;
        double f = (double) a / b;

        System.out.printf("%d %d %.5f%n", d, r, f);

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int a = sc.nextInt();
        int b = sc.nextInt();

        int d = a / b;
        int r = a % b;
        double f = (double) a / b;

        System.out.printf("%d %d %.5f%n", d, r, f);

        sc.close();
    }
}

import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int a = sc.nextInt();
        int b = sc.nextInt();

        int d = a / b;
        int r = a % b;
        double f = (double) a / b;

        System.out.printf("%d %d %.5f\n", d, r, f);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int a = sc.nextInt();
        int b = sc.nextInt();

        int d = a / b;
        int r = a % b;
        double f = (double) a / b;

        System.out.printf("%d %d %.5f\n", d, r, f);

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int a = scanner.nextInt();
        int b = scanner.nextInt();

        int d = a / b;
        int r = a % b;
        double f = (double) a / b;

        System.out.printf("%d %d %.5f%n", d, r, f);

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int a = sc.nextInt();
        int b = sc.nextInt();

        int d = a / b;
        int r = a % b;
        double f = (double) a / b;

        System.out.printf("%d %d %.5f\n", d, r, f);

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int a = sc.nextInt();
        int b = sc.nextInt();

        int d = a / b;
        int r = a % b;
        double f = (double) a / b;

        System.out.printf("%d %d %.5f%n", d, r, f);

        sc.close();
    }
}

import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int a = sc.nextInt();
        int b = sc.nextInt();

        int d = a / b;
        int r = a % b;
        double f = (double) a / b;

        System.out.printf("%d %d %.8f\n", d, r, f);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int a = scanner.nextInt();
        int b = scanner.nextInt();

        int d = a / b;
        int r = a % b;
        double f = (double) a / b;

        System.out.printf("%d %d %.5f%n", d, r, f);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int a = sc.nextInt();
        int b = sc.nextInt();
        int d = a / b;
        int r = a % b;
        double f = (double)a / b;
        System.out.printf("%d %d %.5f\n", d, r, f);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int a = scanner.nextInt();
        int b = scanner.nextInt();

        int d = a / b;
        int r = a % b;
        double f = (double) a / b;

        System.out.printf("%d %d %.5f%n", d, r, f);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int a = sc.nextInt();
        int b = sc.nextInt();

        int d = a / b;
        int r = a % b;
        double f = (double)a / b;

        System.out.printf("%d %d %.5f\n", d, r, f);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int a = scanner.nextInt();
        int b = scanner.nextInt();

        int d = a / b;
        int r = a % b;
        double f = (double) a / b;

        System.out.printf("%d %d %.5f%n", d, r, f);
    }
}

import java.util.Scanner;

public class ABProblem {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int a = scanner.nextInt();
        int b = scanner.nextInt();

        int d = a / b;
        int r = a % b;
        double f = (double) a / b;

        System.out.printf("%d %d %.5f", d, r, f);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int a = sc.nextInt();
        int b = sc.nextInt();
        int d = a / b;
        int r = a % b;
        double f = (double)a / b;
        System.out.printf("%d %d %.5f\n", d, r, f);
    }
}

import java.util.Scanner;

public class ABProblem {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int a = scanner.nextInt();
        int b = scanner.nextInt();

        int d = a / b;
        int r = a % b;
        double f = (double) a / b;

        System.out.printf("%d %d %.5f", d, r, f);
    }
}

import java.util.Scanner;

public class ABProblem {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int a = sc.nextInt();
        int b = sc.nextInt();

        int d = a / b;
        int r = a % b;
        double f = (double) a / b;

        System.out.printf("%d %d %.5f%n", d, r, f);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int a = sc.nextInt();
        int b = sc.nextInt();
        int d = a / b;
        int r = a % b;
        double f = (double)a / b;
        System.out.printf("%d %d %.5f\n", d, r, f);
    }
}

import java.util.Scanner;

public class ABProblem {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int a = sc.nextInt();
        int b = sc.nextInt();

        int d = a / b;
        int r = a % b;
        double f = (double) a / b;

        System.out.printf("%d %d %.5f", d, r, f);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        double r = scanner.nextDouble();

        double area = Math.PI * r * r;
        double circumference = 2 * Math.PI * r;

        System.out.printf("%.6f %.6f%n", area, circumference);

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        double r = sc.nextDouble();

        double area = Math.PI * r * r;
        double circumference = 2 * Math.PI * r;

        System.out.printf("%.8f %.8f\n", area, circumference);

        sc.close();
    }
}

import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        double r = sc.nextDouble();
        double area = Math.PI * r * r;
        double circumference = 2 * Math.PI * r;
        System.out.printf("%.6f %.6f\n", area, circumference);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        double r = scanner.nextDouble();

        double area = Math.PI * r * r;
        double circumference = 2 * Math.PI * r;

        System.out.printf("%.6f %.6f%n", area, circumference);

        scanner.close();
    }
}

import java.util.Scanner;

public class Circle {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        double r = sc.nextDouble();
        double area = Math.PI * r * r;
        double circumference = 2 * Math.PI * r;
        System.out.printf("%.6f %.6f%n", area, circumference);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        double r = scanner.nextDouble();

        double area = Math.PI * r * r;
        double circumference = 2 * Math.PI * r;

        System.out.printf("%.6f %.6f%n", area, circumference);

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        double r = scanner.nextDouble();

        double area = Math.PI * r * r;
        double circumference = 2 * Math.PI * r;

        System.out.printf("%.6f %.6f%n", area, circumference);

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        while (true) {
            int a = scanner.nextInt();
            char op = scanner.next().charAt(0);
            int b = scanner.nextInt();

            if (op == '?') {
                break;
            }

            int result = 0;
            switch (op) {
                case '+':
                    result = a + b;
                    break;
                case '-':
                    result = a - b;
                    break;
                case '*':
                    result = a * b;
                    break;
                case '/':
                    result = a / b;
                    break;
            }

            System.out.println(result);
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int a = sc.nextInt();
            char op = sc.next().charAt(0);
            int b = sc.nextInt();

            if (op == '?') {
                break;
            }

            int result = 0;
            switch (op) {
                case '+':
                    result = a + b;
                    break;
                case '-':
                    result = a - b;
                    break;
                case '*':
                    result = a * b;
                    break;
                case '/':
                    result = a / b;
                    break;
            }

            System.out.println(result);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        while (true) {
            int a = scanner.nextInt();
            char op = scanner.next().charAt(0);
            int b = scanner.nextInt();

            if (op == '?') {
                break;
            }

            int result = 0;
            switch (op) {
                case '+':
                    result = a + b;
                    break;
                case '-':
                    result = a - b;
                    break;
                case '*':
                    result = a * b;
                    break;
                case '/':
                    result = a / b;
                    break;
            }

            System.out.println(result);
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int a = sc.nextInt();
            char op = sc.next().charAt(0);
            int b = sc.nextInt();

            if (op == '?') break;

            int result = 0;
            switch (op) {
                case '+': result = a + b; break;
                case '-': result = a - b; break;
                case '*': result = a * b; break;
                case '/': result = a / b; break;
            }

            System.out.println(result);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class SimpleCalculator {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int a = sc.nextInt();
            char op = sc.next().charAt(0);
            int b = sc.nextInt();

            if (op == '?') break;

            int result = 0;
            switch (op) {
                case '+':
                    result = a + b;
                    break;
                case '-':
                    result = a - b;
                    break;
                case '*':
                    result = a * b;
                    break;
                case '/':
                    result = a / b;
                    break;
            }
            System.out.println(result);
        }
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int a = sc.nextInt();
            char op = sc.next().charAt(0);
            int b = sc.nextInt();

            if (op == '?') break;

            int result = 0;
            switch (op) {
                case '+': result = a + b; break;
                case '-': result = a - b; break;
                case '*': result = a * b; break;
                case '/': result = a / b; break;
            }

            System.out.println(result);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        int min = Integer.MAX_VALUE;
        int max = Integer.MIN_VALUE;
        long sum = 0;

        for (int i = 0; i < n; i++) {
            int a = sc.nextInt();
            min = Math.min(min, a);
            max = Math.max(max, a);
            sum += a;
        }

        System.out.println(min + " " + max + " " + sum);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        int min = Integer.MAX_VALUE;
        int max = Integer.MIN_VALUE;
        long sum = 0;

        for (int i = 0; i < n; i++) {
            int a = sc.nextInt();
            min = Math.min(min, a);
            max = Math.max(max, a);
            sum += a;
        }

        System.out.println(min + " " + max + " " + sum);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        int min = Integer.MAX_VALUE;
        int max = Integer.MIN_VALUE;
        long sum = 0;

        for (int i = 0; i < n; i++) {
            int a = sc.nextInt();
            min = Math.min(min, a);
            max = Math.max(max, a);
            sum += a;
        }

        System.out.println(min + " " + max + " " + sum);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        int min = Integer.MAX_VALUE;
        int max = Integer.MIN_VALUE;
        long sum = 0;

        for (int i = 0; i < n; i++) {
            int a = sc.nextInt();
            min = Math.min(min, a);
            max = Math.max(max, a);
            sum += a;
        }

        System.out.println(min + " " + max + " " + sum);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        int min = Integer.MAX_VALUE;
        int max = Integer.MIN_VALUE;
        long sum = 0;

        for (int i = 0; i < n; i++) {
            int num = sc.nextInt();
            if (num < min) min = num;
            if (num > max) max = num;
            sum += num;
        }

        System.out.println(min + " " + max + " " + sum);
        sc.close();
    }
}

import java.util.Scanner;

public class MinMaxSum {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        int min = Integer.MAX_VALUE;
        int max = Integer.MIN_VALUE;
        long sum = 0;

        for (int i = 0; i < n; i++) {
            int num = scanner.nextInt();
            if (num < min) min = num;
            if (num > max) max = num;
            sum += num;
        }

        System.out.println(min + " " + max + " " + sum);
        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        int min = Integer.MAX_VALUE;
        int max = Integer.MIN_VALUE;
        long sum = 0;

        for (int i = 0; i < n; i++) {
            int num = scanner.nextInt();
            if (num < min) min = num;
            if (num > max) max = num;
            sum += num;
        }

        System.out.println(min + " " + max + " " + sum);
        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int H = sc.nextInt();
            int W = sc.nextInt();

            if (H == 0 && W == 0) {
                break;
            }

            for (int i = 0; i < H; i++) {
                for (int j = 0; j < W; j++) {
                    System.out.print("#");
                }
                System.out.println();
            }
            System.out.println();
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int H = sc.nextInt();
            int W = sc.nextInt();

            if (H == 0 && W == 0) {
                break;
            }

            for (int i = 0; i < H; i++) {
                for (int j = 0; j < W; j++) {
                    System.out.print("#");
                }
                System.out.println();
            }
            System.out.println();
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        while (true) {
            int H = sc.nextInt();
            int W = sc.nextInt();
            if (H == 0 && W == 0) {
                break;
            }
            for (int i = 0; i < H; i++) {
                for (int j = 0; j < W; j++) {
                    System.out.print("#");
                }
                System.out.println();
            }
            System.out.println();
        }
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        while (true) {
            int H = sc.nextInt();
            int W = sc.nextInt();
            if (H == 0 && W == 0) {
                break;
            }
            for (int i = 0; i < H; i++) {
                for (int j = 0; j < W; j++) {
                    System.out.print("#");
                }
                System.out.println();
            }
            System.out.println();
        }
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        while (true) {
            int H = sc.nextInt();
            int W = sc.nextInt();
            if (H == 0 && W == 0) {
                break;
            }
            for (int i = 0; i < H; i++) {
                for (int j = 0; j < W; j++) {
                    System.out.print("#");
                }
                System.out.println();
            }
            System.out.println();
        }
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        while (true) {
            int H = scanner.nextInt();
            int W = scanner.nextInt();

            if (H == 0 && W == 0) {
                break;
            }

            for (int i = 0; i < H; i++) {
                for (int j = 0; j < W; j++) {
                    System.out.print("#");
                }
                System.out.println();
            }
            System.out.println();
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        while (true) {
            int H = scanner.nextInt();
            int W = scanner.nextInt();

            if (H == 0 && W == 0) {
                break;
            }

            for (int i = 0; i < H; i++) {
                for (int j = 0; j < W; j++) {
                    System.out.print("#");
                }
                System.out.println();
            }
            System.out.println();
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        while (true) {
            int H = scanner.nextInt();
            int W = scanner.nextInt();

            if (H == 0 && W == 0) {
                break;
            }

            for (int i = 0; i < H; i++) {
                for (int j = 0; j < W; j++) {
                    if (i == 0 || i == H - 1 || j == 0 || j == W - 1) {
                        System.out.print('#');
                    } else {
                        System.out.print('.');
                    }
                }
                System.out.println();
            }
            System.out.println();
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        while (true) {
            int H = scanner.nextInt();
            int W = scanner.nextInt();

            if (H == 0 && W == 0) {
                break;
            }

            for (int i = 0; i < H; i++) {
                for (int j = 0; j < W; j++) {
                    if (i == 0 || i == H - 1 || j == 0 || j == W - 1) {
                        System.out.print('#');
                    } else {
                        System.out.print('.');
                    }
                }
                System.out.println();
            }
            System.out.println();
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        while (true) {
            int H = scanner.nextInt();
            int W = scanner.nextInt();

            if (H == 0 && W == 0) {
                break;
            }

            for (int i = 0; i < H; i++) {
                for (int j = 0; j < W; j++) {
                    if (i == 0 || i == H - 1 || j == 0 || j == W - 1) {
                        System.out.print('#');
                    } else {
                        System.out.print('.');
                    }
                }
                System.out.println();
            }
            System.out.println();
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        while (true) {
            int H = scanner.nextInt();
            int W = scanner.nextInt();

            if (H == 0 && W == 0) {
                break;
            }

            for (int i = 0; i < H; i++) {
                for (int j = 0; j < W; j++) {
                    if ((i + j) % 2 == 0) {
                        System.out.print("#");
                    } else {
                        System.out.print(".");
                    }
                }
                System.out.println();
            }
            System.out.println();
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        while (true) {
            int H = sc.nextInt();
            int W = sc.nextInt();
            if (H == 0 && W == 0) {
                break;
            }
            for (int i = 0; i < H; i++) {
                for (int j = 0; j < W; j++) {
                    if ((i + j) % 2 == 0) {
                        System.out.print("#");
                    } else {
                        System.out.print(".");
                    }
                }
                System.out.println();
            }
            System.out.println();
        }
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        while (true) {
            int H = scanner.nextInt();
            int W = scanner.nextInt();
            if (H == 0 && W == 0) {
                break;
            }
            for (int i = 0; i < H; i++) {
                for (int j = 0; j < W; j++) {
                    if ((i + j) % 2 == 0) {
                        System.out.print("#");
                    } else {
                        System.out.print(".");
                    }
                }
                System.out.println();
            }
            System.out.println();
        }
        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        while (true) {
            int H = sc.nextInt();
            int W = sc.nextInt();
            if (H == 0 && W == 0) {
                break;
            }
            for (int i = 0; i < H; i++) {
                for (int j = 0; j < W; j++) {
                    if ((i + j) % 2 == 0) {
                        System.out.print("#");
                    } else {
                        System.out.print(".");
                    }
                }
                System.out.println();
            }
            System.out.println();
        }
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        while (true) {
            int H = sc.nextInt();
            int W = sc.nextInt();
            if (H == 0 && W == 0) {
                break;
            }
            for (int i = 0; i < H; i++) {
                for (int j = 0; j < W; j++) {
                    if ((i + j) % 2 == 0) {
                        System.out.print("#");
                    } else {
                        System.out.print(".");
                    }
                }
                System.out.println();
            }
            System.out.println();
        }
        sc.close();
    }
}

import java.util.Scanner;

public class Chessboard {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        while (true) {
            int H = scanner.nextInt();
            int W = scanner.nextInt();
            if (H == 0 && W == 0) {
                break;
            }
            for (int i = 0; i < H; i++) {
                for (int j = 0; j < W; j++) {
                    if ((i + j) % 2 == 0) {
                        System.out.print("#");
                    } else {
                        System.out.print(".");
                    }
                }
                System.out.println();
            }
            System.out.println();
        }
        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        while (true) {
            int H = sc.nextInt();
            int W = sc.nextInt();
            if (H == 0 && W == 0) {
                break;
            }
            for (int i = 0; i < H; i++) {
                for (int j = 0; j < W; j++) {
                    if ((i + j) % 2 == 0) {
                        System.out.print("#");
                    } else {
                        System.out.print(".");
                    }
                }
                System.out.println();
            }
            System.out.println();
        }
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        while (true) {
            int H = scanner.nextInt();
            int W = scanner.nextInt();
            if (H == 0 && W == 0) {
                break;
            }

            for (int i = 0; i < H; i++) {
                for (int j = 0; j < W; j++) {
                    if ((i + j) % 2 == 0) {
                        System.out.print("#");
                    } else {
                        System.out.print(".");
                    }
                }
                System.out.println();
            }
            System.out.println();
        }
        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        call(n);
        sc.close();
    }

    static void call(int n) {
        for (int i = 1; i <= n; i++) {
            int x = i;
            if (x % 3 == 0) {
                System.out.print(" " + i);
                continue;
            }

            while (x > 0) {
                if (x % 10 == 3) {
                    System.out.print(" " + i);
                    break;
                }
                x /= 10;
            }
        }
        System.out.println();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        call(n);
        sc.close();
    }

    static void call(int n) {
        for (int i = 1; i <= n; i++) {
            int x = i;

            if (x % 3 == 0) {
                System.out.print(" " + i);
                continue;
            }

            while (x > 0) {
                if (x % 10 == 3) {
                    System.out.print(" " + i);
                    break;
                }
                x /= 10;
            }
        }
        System.out.println();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        call(n);
        sc.close();
    }

    static void call(int n) {
        for (int i = 1; i <= n; i++) {
            if (i % 3 == 0 || containsDigit3(i)) {
                System.out.print(" " + i);
            }
        }
        System.out.println();
    }

    static boolean containsDigit3(int x) {
        while (x > 0) {
            if (x % 10 == 3) {
                return true;
            }
            x /= 10;
        }
        return false;
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        call(n);
        sc.close();
    }

    static void call(int n) {
        for (int i = 1; i <= n; i++) {
            if (i % 3 == 0 || containsDigit3(i)) {
                System.out.print(" " + i);
            }
        }
        System.out.println();
    }

    static boolean containsDigit3(int x) {
        while (x > 0) {
            if (x % 10 == 3) {
                return true;
            }
            x /= 10;
        }
        return false;
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] arr = new int[n];

        for (int i = 0; i < n; i++) {
            arr[i] = sc.nextInt();
        }

        for (int i = n - 1; i >= 0; i--) {
            System.out.print(arr[i]);
            if (i > 0) {
                System.out.print(" ");
            }
        }
        System.out.println();

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] a = new int[n];
        for (int i = 0; i < n; i++) {
            a[i] = sc.nextInt();
        }
        for (int i = n - 1; i >= 0; i--) {
            System.out.print(a[i]);
            if (i > 0) {
                System.out.print(" ");
            }
        }
        System.out.println();
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] arr = new int[n];

        for (int i = 0; i < n; i++) {
            arr[i] = sc.nextInt();
        }

        for (int i = n - 1; i >= 0; i--) {
            System.out.print(arr[i]);
            if (i > 0) {
                System.out.print(" ");
            }
        }
        System.out.println();

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] arr = new int[n];

        for (int i = 0; i < n; i++) {
            arr[i] = sc.nextInt();
        }

        for (int i = n - 1; i >= 0; i--) {
            System.out.print(arr[i]);
            if (i > 0) {
                System.out.print(" ");
            }
        }
        System.out.println();

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        int n = scanner.nextInt();
        int[] arr = new int[n];

        for (int i = 0; i < n; i++) {
            arr[i] = scanner.nextInt();
        }

        for (int i = n - 1; i >= 0; i--) {
            System.out.print(arr[i]);
            if (i > 0) {
                System.out.print(" ");
            }
        }
        System.out.println();

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] a = new int[n];
        for (int i = 0; i < n; i++) {
            a[i] = sc.nextInt();
        }

        for (int i = n - 1; i >= 0; i--) {
            System.out.print(a[i]);
            if (i > 0) {
                System.out.print(" ");
            }
        }
        System.out.println();
        sc.close();
    }
}

import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] a = new int[n];
        for (int i = 0; i < n; i++) {
            a[i] = sc.nextInt();
        }

        for (int i = n - 1; i >= 0; i--) {
            System.out.print(a[i]);
            if (i > 0) {
                System.out.print(" ");
            }
        }
        System.out.println();
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int[][][] buildings = new int[4][3][10];

        int n = sc.nextInt();

        for (int i = 0; i < n; i++) {
            int b = sc.nextInt() - 1;
            int f = sc.nextInt() - 1;
            int r = sc.nextInt() - 1;
            int v = sc.nextInt();

            buildings[b][f][r] += v;
        }

        for (int b = 0; b < 4; b++) {
            for (int f = 0; f < 3; f++) {
                for (int r = 0; r < 10; r++) {
                    System.out.print(" " + buildings[b][f][r]);
                }
                System.out.println();
            }
            if (b < 3) {
                System.out.println("####################");
            }
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int[][][] buildings = new int[4][3][10];

        int n = sc.nextInt();

        for (int i = 0; i < n; i++) {
            int b = sc.nextInt() - 1;
            int f = sc.nextInt() - 1;
            int r = sc.nextInt() - 1;
            int v = sc.nextInt();

            buildings[b][f][r] += v;
        }

        for (int b = 0; b < 4; b++) {
            for (int f = 0; f < 3; f++) {
                for (int r = 0; r < 10; r++) {
                    System.out.print(" " + buildings[b][f][r]);
                }
                System.out.println();
            }
            if (b < 3) {
                System.out.println("####################");
            }
        }

        sc.close();
    }
}

import java.util.Scanner;

public class OfficialHouse {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int[][][] buildings = new int[4][3][10];

        int n = sc.nextInt();

        for (int i = 0; i < n; i++) {
            int b = sc.nextInt() - 1;
            int f = sc.nextInt() - 1;
            int r = sc.nextInt() - 1;
            int v = sc.nextInt();

            buildings[b][f][r] += v;
        }

        for (int b = 0; b < 4; b++) {
            for (int f = 0; f < 3; f++) {
                for (int r = 0; r < 10; r++) {
                    System.out.print(" " + buildings[b][f][r]);
                }
                System.out.println();
            }
            if (b < 3) {
                System.out.println("####################");
            }
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int[][][] buildings = new int[4][3][10];

        int n = sc.nextInt();

        for (int i = 0; i < n; i++) {
            int b = sc.nextInt() - 1;
            int f = sc.nextInt() - 1;
            int r = sc.nextInt() - 1;
            int v = sc.nextInt();

            buildings[b][f][r] += v;
        }

        for (int b = 0; b < 4; b++) {
            for (int f = 0; f < 3; f++) {
                for (int r = 0; r < 10; r++) {
                    System.out.print(" " + buildings[b][f][r]);
                }
                System.out.println();
            }
            if (b < 3) {
                System.out.println("####################");
            }
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int[][][] buildings = new int[4][3][10];

        int n = sc.nextInt();

        for (int i = 0; i < n; i++) {
            int b = sc.nextInt() - 1;
            int f = sc.nextInt() - 1;
            int r = sc.nextInt() - 1;
            int v = sc.nextInt();

            buildings[b][f][r] += v;
        }

        for (int b = 0; b < 4; b++) {
            for (int f = 0; f < 3; f++) {
                for (int r = 0; r < 10; r++) {
                    System.out.print(" " + buildings[b][f][r]);
                }
                System.out.println();
            }
            if (b < 3) {
                System.out.println("####################");
            }
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        int m = sc.nextInt();

        int[][] A = new int[n][m];
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                A[i][j] = sc.nextInt();
            }
        }

        int[] b = new int[m];
        for (int i = 0; i < m; i++) {
            b[i] = sc.nextInt();
        }

        for (int i = 0; i < n; i++) {
            int sum = 0;
            for (int j = 0; j < m; j++) {
                sum += A[i][j] * b[j];
            }
            System.out.println(sum);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        int m = sc.nextInt();

        int[][] A = new int[n][m];
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                A[i][j] = sc.nextInt();
            }
        }

        int[] b = new int[m];
        for (int i = 0; i < m; i++) {
            b[i] = sc.nextInt();
        }

        for (int i = 0; i < n; i++) {
            int sum = 0;
            for (int j = 0; j < m; j++) {
                sum += A[i][j] * b[j];
            }
            System.out.println(sum);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        int m = sc.nextInt();

        int[][] A = new int[n][m];
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                A[i][j] = sc.nextInt();
            }
        }

        int[] b = new int[m];
        for (int i = 0; i < m; i++) {
            b[i] = sc.nextInt();
        }

        for (int i = 0; i < n; i++) {
            int sum = 0;
            for (int j = 0; j < m; j++) {
                sum += A[i][j] * b[j];
            }
            System.out.println(sum);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        int m = sc.nextInt();

        int[][] a = new int[n][m];
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                a[i][j] = sc.nextInt();
            }
        }

        int[] b = new int[m];
        for (int i = 0; i < m; i++) {
            b[i] = sc.nextInt();
        }

        for (int i = 0; i < n; i++) {
            int sum = 0;
            for (int j = 0; j < m; j++) {
                sum += a[i][j] * b[j];
            }
            System.out.println(sum);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        int m = sc.nextInt();

        int[][] A = new int[n][m];
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                A[i][j] = sc.nextInt();
            }
        }

        int[] b = new int[m];
        for (int i = 0; i < m; i++) {
            b[i] = sc.nextInt();
        }

        for (int i = 0; i < n; i++) {
            int sum = 0;
            for (int j = 0; j < m; j++) {
                sum += A[i][j] * b[j];
            }
            System.out.println(sum);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        int m = sc.nextInt();

        int[][] matrix = new int[n][m];
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                matrix[i][j] = sc.nextInt();
            }
        }

        int[] vector = new int[m];
        for (int i = 0; i < m; i++) {
            vector[i] = sc.nextInt();
        }

        for (int i = 0; i < n; i++) {
            int result = 0;
            for (int j = 0; j < m; j++) {
                result += matrix[i][j] * vector[j];
            }
            System.out.println(result);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        int m = sc.nextInt();

        int[][] a = new int[n][m];
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                a[i][j] = sc.nextInt();
            }
        }

        int[] b = new int[m];
        for (int i = 0; i < m; i++) {
            b[i] = sc.nextInt();
        }

        for (int i = 0; i < n; i++) {
            int sum = 0;
            for (int j = 0; j < m; j++) {
                sum += a[i][j] * b[j];
            }
            System.out.println(sum);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        while (true) {
            int m = scanner.nextInt();
            int f = scanner.nextInt();
            int r = scanner.nextInt();

            if (m == -1 && f == -1 && r == -1) {
                break;
            }

            char grade;

            if (m == -1 || f == -1) {
                grade = 'F';
            } else {
                int total = m + f;

                if (total >= 80) {
                    grade = 'A';
                } else if (total >= 65) {
                    grade = 'B';
                } else if (total >= 50) {
                    grade = 'C';
                } else if (total >= 30) {
                    if (r >= 50) {
                        grade = 'C';
                    } else {
                        grade = 'D';
                    }
                } else {
                    grade = 'F';
                }
            }

            System.out.println(grade);
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int m = sc.nextInt();
            int f = sc.nextInt();
            int r = sc.nextInt();

            if (m == -1 && f == -1 && r == -1) {
                break;
            }

            char grade;
            if (m == -1 || f == -1) {
                grade = 'F';
            } else {
                int total = m + f;
                if (total >= 80) {
                    grade = 'A';
                } else if (total >= 65) {
                    grade = 'B';
                } else if (total >= 50) {
                    grade = 'C';
                } else if (total >= 30) {
                    if (r >= 50) {
                        grade = 'C';
                    } else {
                        grade = 'D';
                    }
                } else {
                    grade = 'F';
                }
            }
            System.out.println(grade);
        }
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int m = sc.nextInt();
            int f = sc.nextInt();
            int r = sc.nextInt();

            if (m == -1 && f == -1 && r == -1) {
                break;
            }

            char grade;
            if (m == -1 || f == -1) {
                grade = 'F';
            } else {
                int total = m + f;
                if (total >= 80) {
                    grade = 'A';
                } else if (total >= 65) {
                    grade = 'B';
                } else if (total >= 50) {
                    grade = 'C';
                } else if (total >= 30) {
                    if (r >= 50) {
                        grade = 'C';
                    } else {
                        grade = 'D';
                    }
                } else {
                    grade = 'F';
                }
            }
            System.out.println(grade);
        }
        sc.close();
    }
}

import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int m = sc.nextInt();
            int f = sc.nextInt();
            int r = sc.nextInt();

            if (m == -1 && f == -1 && r == -1) {
                break;
            }

            char grade;
            if (m == -1 || f == -1) {
                grade = 'F';
            } else {
                int total = m + f;
                if (total >= 80) {
                    grade = 'A';
                } else if (total >= 65) {
                    grade = 'B';
                } else if (total >= 50) {
                    grade = 'C';
                } else if (total >= 30) {
                    if (r >= 50) {
                        grade = 'C';
                    } else {
                        grade = 'D';
                    }
                } else {
                    grade = 'F';
                }
            }
            System.out.println(grade);
        }
        sc.close();
    }
}

import java.util.Scanner;

public class Grading {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        while (true) {
            int m = scanner.nextInt();
            int f = scanner.nextInt();
            int r = scanner.nextInt();

            if (m == -1 && f == -1 && r == -1) {
                break;
            }

            char grade;
            if (m == -1 || f == -1) {
                grade = 'F';
            } else {
                int total = m + f;
                if (total >= 80) {
                    grade = 'A';
                } else if (total >= 65) {
                    grade = 'B';
                } else if (total >= 50) {
                    grade = 'C';
                } else if (total >= 30) {
                    if (r >= 50) {
                        grade = 'C';
                    } else {
                        grade = 'D';
                    }
                } else {
                    grade = 'F';
                }
            }
            System.out.println(grade);
        }
        scanner.close();
    }
}

import java.util.Scanner;

public class Grading {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        while (true) {
            int m = scanner.nextInt();
            int f = scanner.nextInt();
            int r = scanner.nextInt();

            if (m == -1 && f == -1 && r == -1) {
                break;
            }

            char grade;
            if (m == -1 || f == -1) {
                grade = 'F';
            } else {
                int total = m + f;
                if (total >= 80) {
                    grade = 'A';
                } else if (total >= 65) {
                    grade = 'B';
                } else if (total >= 50) {
                    grade = 'C';
                } else if (total >= 30) {
                    if (r >= 50) {
                        grade = 'C';
                    } else {
                        grade = 'D';
                    }
                } else {
                    grade = 'F';
                }
            }
            System.out.println(grade);
        }
        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int m = sc.nextInt();
            int f = sc.nextInt();
            int r = sc.nextInt();

            if (m == -1 && f == -1 && r == -1) {
                break;
            }

            char grade = calculateGrade(m, f, r);
            System.out.println(grade);
        }

        sc.close();
    }

    private static char calculateGrade(int m, int f, int r) {
        if (m == -1 || f == -1) {
            return 'F';
        }

        int total = m + f;

        if (total >= 80) {
            return 'A';
        } else if (total >= 65) {
            return 'B';
        } else if (total >= 50) {
            return 'C';
        } else if (total >= 30) {
            if (r >= 50) {
                return 'C';
            } else {
                return 'D';
            }
        } else {
            return 'F';
        }
    }
}

import java.util.Scanner;

public class Main {

  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);

    while (true) {
      int m = sc.nextInt();
      int f = sc.nextInt();
      int r = sc.nextInt();

      if (m == -1 && f == -1 && r == -1) {
        break;
      }

      char grade = calculateGrade(m, f, r);
      System.out.println(grade);
    }

    sc.close();
  }

  private static char calculateGrade(int m, int f, int r) {
    if (m == -1 || f == -1) {
      return 'F';
    }

    int total = m + f;

    if (total >= 80) {
      return 'A';
    } else if (total >= 65) {
      return 'B';
    } else if (total >= 50) {
      return 'C';
    } else if (total >= 30) {
      if (r >= 50) {
        return 'C';
      } else {
        return 'D';
      }
    } else {
      return 'F';
    }
  }
}

import java.util.Scanner;

public class Grading {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        while (true) {
            int m = scanner.nextInt();
            int f = scanner.nextInt();
            int r = scanner.nextInt();

            if (m == -1 && f == -1 && r == -1) {
                break;
            }

            char grade = calculateGrade(m, f, r);
            System.out.println(grade);
        }
        scanner.close();
    }

    private static char calculateGrade(int m, int f, int r) {
        if (m == -1 || f == -1) {
            return 'F';
        }

        int total = m + f;

        if (total >= 80) {
            return 'A';
        } else if (total >= 65) {
            return 'B';
        } else if (total >= 50) {
            return 'C';
        } else if (total >= 30) {
            if (r >= 50) {
                return 'C';
            } else {
                return 'D';
            }
        } else {
            return 'F';
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int m = sc.nextInt();
            int f = sc.nextInt();
            int r = sc.nextInt();

            if (m == -1 && f == -1 && r == -1) {
                break;
            }

            if (m == -1 || f == -1) {
                System.out.println("F");
                continue;
            }

            int total = m + f;

            if (total >= 80) {
                System.out.println("A");
            } else if (total >= 65) {
                System.out.println("B");
            } else if (total >= 50) {
                System.out.println("C");
            } else if (total >= 30) {
                if (r >= 50) {
                    System.out.println("C");
                } else {
                    System.out.println("D");
                }
            } else {
                System.out.println("F");
            }
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int m = sc.nextInt();
            int f = sc.nextInt();
            int r = sc.nextInt();

            if (m == -1 && f == -1 && r == -1) {
                break;
            }

            if (m == -1 || f == -1) {
                System.out.println("F");
                continue;
            }

            int total = m + f;

            if (total >= 80) {
                System.out.println("A");
            } else if (total >= 65) {
                System.out.println("B");
            } else if (total >= 50) {
                System.out.println("C");
            } else if (total >= 30) {
                if (r >= 50) {
                    System.out.println("C");
                } else {
                    System.out.println("D");
                }
            } else {
                System.out.println("F");
            }
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            int x = sc.nextInt();

            if (n == 0 && x == 0) break;

            int count = 0;

            for (int i = 1; i <= n - 2; i++) {
                for (int j = i + 1; j <= n - 1; j++) {
                    int k = x - i - j;
                    if (k > j && k <= n) {
                        count++;
                    }
                }
            }

            System.out.println(count);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            int x = sc.nextInt();

            if (n == 0 && x == 0) break;

            int count = 0;

            for (int i = 1; i <= n - 2; i++) {
                for (int j = i + 1; j <= n - 1; j++) {
                    int k = x - i - j;
                    if (k > j && k <= n) {
                        count++;
                    }
                }
            }

            System.out.println(count);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        while (true) {
            int n = sc.nextInt();
            int x = sc.nextInt();
            if (n == 0 && x == 0) break;
            int count = 0;
            for (int a = 1; a <= n - 2; a++) {
                for (int b = a + 1; b <= n - 1; b++) {
                    int c = x - a - b;
                    if (c > b && c <= n) {
                        count++;
                    }
                }
            }
            System.out.println(count);
        }
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        while (true) {
            int n = scanner.nextInt();
            int x = scanner.nextInt();

            if (n == 0 && x == 0) {
                break;
            }

            int count = 0;

            for (int i = 1; i <= n; i++) {
                for (int j = i + 1; j <= n; j++) {
                    for (int k = j + 1; k <= n; k++) {
                        if (i + j + k == x) {
                            count++;
                        }
                    }
                }
            }

            System.out.println(count);
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            int x = sc.nextInt();

            if (n == 0 && x == 0) {
                break;
            }

            int count = 0;
            for (int i = 1; i <= n; i++) {
                for (int j = i + 1; j <= n; j++) {
                    for (int k = j + 1; k <= n; k++) {
                        if (i + j + k == x) {
                            count++;
                        }
                    }
                }
            }
            System.out.println(count);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        while (true) {
            int n = scanner.nextInt();
            int x = scanner.nextInt();
            if (n == 0 && x == 0) {
                break;
            }
            int count = 0;
            for (int i = 1; i <= n; i++) {
                for (int j = i + 1; j <= n; j++) {
                    for (int k = j + 1; k <= n; k++) {
                        if (i + j + k == x) {
                            count++;
                        }
                    }
                }
            }
            System.out.println(count);
        }
        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        while (true) {
            int n = scanner.nextInt();
            int x = scanner.nextInt();
            if (n == 0 && x == 0) {
                break;
            }
            int count = 0;
            for (int i = 1; i <= n; i++) {
                for (int j = i + 1; j <= n; j++) {
                    for (int k = j + 1; k <= n; k++) {
                        if (i + j + k == x) {
                            count++;
                        }
                    }
                }
            }
            System.out.println(count);
        }
        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            int n = sc.nextInt();
            int x = sc.nextInt();

            if (n == 0 && x == 0) {
                break;
            }

            int count = 0;
            for (int i = 1; i <= n; i++) {
                for (int j = i + 1; j <= n; j++) {
                    for (int k = j + 1; k <= n; k++) {
                        if (i + j + k == x) {
                            count++;
                        }
                    }
                }
            }
            System.out.println(count);
        }
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        while (true) {
            int n = scanner.nextInt();
            int x = scanner.nextInt();

            if (n == 0 && x == 0) {
                break;
            }

            int count = 0;

            for (int i = 1; i <= n; i++) {
                for (int j = i + 1; j <= n; j++) {
                    for (int k = j + 1; k <= n; k++) {
                        if (i + j + k == x) {
                            count++;
                        }
                    }
                }
            }

            System.out.println(count);
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        while (true) {
            int n = scanner.nextInt();
            int x = scanner.nextInt();

            if (n == 0 && x == 0) {
                break;
            }

            int count = 0;

            for (int i = 1; i <= n; i++) {
                for (int j = i + 1; j <= n; j++) {
                    for (int k = j + 1; k <= n; k++) {
                        if (i + j + k == x) {
                            count++;
                        }
                    }
                }
            }

            System.out.println(count);
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int r = sc.nextInt();
        int c = sc.nextInt();

        int[][] table = new int[r][c];

        for (int i = 0; i < r; i++) {
            for (int j = 0; j < c; j++) {
                table[i][j] = sc.nextInt();
            }
        }

        int[] rowSums = new int[r];
        for (int i = 0; i < r; i++) {
            for (int j = 0; j < c; j++) {
                rowSums[i] += table[i][j];
            }
        }

        int[] colSums = new int[c];
        for (int j = 0; j < c; j++) {
            for (int i = 0; i < r; i++) {
                colSums[j] += table[i][j];
            }
        }

        int totalSum = 0;
        for (int i = 0; i < r; i++) {
            totalSum += rowSums[i];
        }

        for (int i = 0; i < r; i++) {
            for (int j = 0; j < c; j++) {
                System.out.print(table[i][j] + " ");
            }
            System.out.println(rowSums[i]);
        }

        for (int j = 0; j < c; j++) {
            System.out.print(colSums[j] + " ");
        }
        System.out.println(totalSum);

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int r = sc.nextInt();
        int c = sc.nextInt();

        int[][] table = new int[r][c];

        for (int i = 0; i < r; i++) {
            for (int j = 0; j < c; j++) {
                table[i][j] = sc.nextInt();
            }
        }

        int[] rowSums = new int[r];
        for (int i = 0; i < r; i++) {
            for (int j = 0; j < c; j++) {
                rowSums[i] += table[i][j];
            }
        }

        int[] colSums = new int[c];
        for (int j = 0; j < c; j++) {
            for (int i = 0; i < r; i++) {
                colSums[j] += table[i][j];
            }
        }

        int totalSum = 0;
        for (int i = 0; i < r; i++) {
            totalSum += rowSums[i];
        }

        for (int i = 0; i < r; i++) {
            for (int j = 0; j < c; j++) {
                System.out.print(table[i][j] + " ");
            }
            System.out.println(rowSums[i]);
        }

        for (int j = 0; j < c; j++) {
            System.out.print(colSums[j] + " ");
        }
        System.out.println(totalSum);

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        int m = sc.nextInt();
        int l = sc.nextInt();

        int[][] A = new int[n][m];
        int[][] B = new int[m][l];

        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                A[i][j] = sc.nextInt();
            }
        }

        for (int i = 0; i < m; i++) {
            for (int j = 0; j < l; j++) {
                B[i][j] = sc.nextInt();
            }
        }

        for (int i = 0; i < n; i++) {
            for (int j = 0; j < l; j++) {
                int sum = 0;
                for (int k = 0; k < m; k++) {
                    sum += A[i][k] * B[k][j];
                }
                if (j > 0) System.out.print(" ");
                System.out.print(sum);
            }
            System.out.println();
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        int m = sc.nextInt();
        int l = sc.nextInt();

        int[][] A = new int[n][m];
        int[][] B = new int[m][l];

        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                A[i][j] = sc.nextInt();
            }
        }

        for (int i = 0; i < m; i++) {
            for (int j = 0; j < l; j++) {
                B[i][j] = sc.nextInt();
            }
        }

        for (int i = 0; i < n; i++) {
            for (int j = 0; j < l; j++) {
                int sum = 0;
                for (int k = 0; k < m; k++) {
                    sum += A[i][k] * B[k][j];
                }
                if (j > 0) System.out.print(" ");
                System.out.print(sum);
            }
            System.out.println();
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        int m = sc.nextInt();
        int l = sc.nextInt();

        int[][] A = new int[n][m];
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                A[i][j] = sc.nextInt();
            }
        }

        int[][] B = new int[m][l];
        for (int i = 0; i < m; i++) {
            for (int j = 0; j < l; j++) {
                B[i][j] = sc.nextInt();
            }
        }

        int[][] C = new int[n][l];
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < l; j++) {
                for (int k = 0; k < m; k++) {
                    C[i][j] += A[i][k] * B[k][j];
                }
            }
        }

        for (int i = 0; i < n; i++) {
            for (int j = 0; j < l; j++) {
                if (j > 0) System.out.print(" ");
                System.out.print(C[i][j]);
            }
            System.out.println();
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        int m = sc.nextInt();
        int l = sc.nextInt();

        int[][] A = new int[n][m];
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                A[i][j] = sc.nextInt();
            }
        }

        int[][] B = new int[m][l];
        for (int i = 0; i < m; i++) {
            for (int j = 0; j < l; j++) {
                B[i][j] = sc.nextInt();
            }
        }

        int[][] C = new int[n][l];
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < l; j++) {
                for (int k = 0; k < m; k++) {
                    C[i][j] += A[i][k] * B[k][j];
                }
            }
        }

        for (int i = 0; i < n; i++) {
            for (int j = 0; j < l; j++) {
                if (j > 0) System.out.print(" ");
                System.out.print(C[i][j]);
            }
            System.out.println();
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        String input = scanner.nextLine();

        StringBuilder result = new StringBuilder();

        for (char c : input.toCharArray()) {
            if (Character.isUpperCase(c)) {
                result.append(Character.toLowerCase(c));
            } else if (Character.isLowerCase(c)) {
                result.append(Character.toUpperCase(c));
            } else {
                result.append(c);
            }
        }

        System.out.println(result.toString());
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        String input = scanner.nextLine();
        StringBuilder result = new StringBuilder();

        for (char c : input.toCharArray()) {
            if (Character.isUpperCase(c)) {
                result.append(Character.toLowerCase(c));
            } else if (Character.isLowerCase(c)) {
                result.append(Character.toUpperCase(c));
            } else {
                result.append(c);
            }
        }

        System.out.println(result.toString());
    }
}

import java.util.Scanner;

public class ToggleCases {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String input = sc.nextLine();
        StringBuilder sb = new StringBuilder();
        for (char c : input.toCharArray()) {
            if (Character.isUpperCase(c)) {
                sb.append(Character.toLowerCase(c));
            } else if (Character.isLowerCase(c)) {
                sb.append(Character.toUpperCase(c));
            } else {
                sb.append(c);
            }
        }
        System.out.println(sb.toString());
    }
}

import java.util.Scanner;

public class ToggleCases {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String input = sc.nextLine();
        StringBuilder sb = new StringBuilder();

        for (char c : input.toCharArray()) {
            if (Character.isUpperCase(c)) {
                sb.append(Character.toLowerCase(c));
            } else if (Character.isLowerCase(c)) {
                sb.append(Character.toUpperCase(c));
            } else {
                sb.append(c);
            }
        }

        System.out.println(sb.toString());
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        String input = scanner.nextLine();

        StringBuilder result = new StringBuilder();
        for (char c : input.toCharArray()) {
            if (Character.isUpperCase(c)) {
                result.append(Character.toLowerCase(c));
            } else if (Character.isLowerCase(c)) {
                result.append(Character.toUpperCase(c));
            } else {
                result.append(c);
            }
        }

        System.out.println(result.toString());
        scanner.close();
    }
}

import java.util.Scanner;

public class Main {

  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    String input = sc.nextLine();
    StringBuilder output = new StringBuilder();

    for (char c : input.toCharArray()) {
      if (Character.isUpperCase(c)) {
        output.append(Character.toLowerCase(c));
      } else if (Character.isLowerCase(c)) {
        output.append(Character.toUpperCase(c));
      } else {
        output.append(c);
      }
    }

    System.out.println(output.toString());
    sc.close();
  }
}

import java.util.Scanner;

public class Main {

  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    String input = sc.nextLine();
    StringBuilder output = new StringBuilder();

    for (char c : input.toCharArray()) {
      if (Character.isUpperCase(c)) {
        output.append(Character.toLowerCase(c));
      } else if (Character.isLowerCase(c)) {
        output.append(Character.toUpperCase(c));
      } else {
        output.append(c);
      }
    }

    System.out.println(output.toString());
    sc.close();
  }
}

import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String str = sc.nextLine();
        StringBuilder sb = new StringBuilder();

        for (char c : str.toCharArray()) {
            if (Character.isUpperCase(c)) {
                sb.append(Character.toLowerCase(c));
            } else if (Character.isLowerCase(c)) {
                sb.append(Character.toUpperCase(c));
            } else {
                sb.append(c);
            }
        }
        System.out.println(sb.toString());
        sc.close();
    }
}

import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String input = sc.nextLine();
        StringBuilder output = new StringBuilder();

        for (char c : input.toCharArray()) {
            if (Character.isUpperCase(c)) {
                output.append(Character.toLowerCase(c));
            } else if (Character.isLowerCase(c)) {
                output.append(Character.toUpperCase(c));
            } else {
                output.append(c);
            }
        }
        System.out.println(output.toString());
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        String input = scanner.nextLine();

        StringBuilder result = new StringBuilder();

        for (int i = 0; i < input.length(); i++) {
            char c = input.charAt(i);
            if (Character.isUpperCase(c)) {
                result.append(Character.toLowerCase(c));
            } else if (Character.isLowerCase(c)) {
                result.append(Character.toUpperCase(c));
            } else {
                result.append(c);
            }
        }

        System.out.println(result.toString());
        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        String input = scanner.nextLine();

        StringBuilder result = new StringBuilder();

        for (int i = 0; i < input.length(); i++) {
            char c = input.charAt(i);

            if (Character.isUpperCase(c)) {
                result.append(Character.toLowerCase(c));
            } else if (Character.isLowerCase(c)) {
                result.append(Character.toUpperCase(c));
            } else {
                result.append(c);
            }
        }

        System.out.println(result.toString());
        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        while (true) {
            String input = scanner.nextLine();
            if (input.equals("0")) {
                break;
            }

            int sum = 0;
            for (char c : input.toCharArray()) {
                if (Character.isDigit(c)) {
                    sum += Character.getNumericValue(c);
                }
            }

            System.out.println(sum);
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        while (true) {
            String input = scanner.nextLine();
            if (input.equals("0")) {
                break;
            }

            int sum = 0;
            for (char c : input.toCharArray()) {
                if (Character.isDigit(c)) {
                    sum += Character.getNumericValue(c);
                }
            }

            System.out.println(sum);
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        while (true) {
            String input = scanner.nextLine();
            if (input.equals("0")) {
                break;
            }

            int sum = 0;
            for (char c : input.toCharArray()) {
                if (Character.isDigit(c)) {
                    sum += Character.getNumericValue(c);
                }
            }

            System.out.println(sum);
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        while (true) {
            String input = scanner.nextLine();
            if (input.equals("0")) {
                break;
            }

            int sum = 0;
            for (char c : input.toCharArray()) {
                if (Character.isDigit(c)) {
                    sum += Character.getNumericValue(c);
                }
            }

            System.out.println(sum);
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int[] count = new int[26];

        while (scanner.hasNextLine()) {
            String line = scanner.nextLine().toLowerCase();
            for (char c : line.toCharArray()) {
                if (c >= 'a' && c <= 'z') {
                    count[c - 'a']++;
                }
            }
        }

        for (int i = 0; i < 26; i++) {
            System.out.println((char)('a' + i) + " : " + count[i]);
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int[] count = new int[26];

        while (scanner.hasNextLine()) {
            String line = scanner.nextLine().toLowerCase();
            for (char c : line.toCharArray()) {
                if (c >= 'a' && c <= 'z') {
                    count[c - 'a']++;
                }
            }
        }

        for (int i = 0; i < 26; i++) {
            System.out.println((char)('a' + i) + " : " + count[i]);
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int[] count = new int[26];

        while (scanner.hasNextLine()) {
            String line = scanner.nextLine().toLowerCase();
            for (char c : line.toCharArray()) {
                if (c >= 'a' && c <= 'z') {
                    count[c - 'a']++;
                }
            }
        }

        for (int i = 0; i < 26; i++) {
            System.out.println((char)('a' + i) + " : " + count[i]);
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int[] count = new int[26];

        while (scanner.hasNextLine()) {
            String line = scanner.nextLine().toLowerCase();
            for (char c : line.toCharArray()) {
                if (c >= 'a' && c <= 'z') {
                    count[c - 'a']++;
                }
            }
        }

        for (int i = 0; i < 26; i++) {
            System.out.println((char)('a' + i) + " : " + count[i]);
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String s = sc.nextLine();
        String p = sc.nextLine();

        String ring = s + s;

        boolean found = false;
        for (int i = 0; i < s.length(); i++) {
            if (ring.substring(i, i + p.length()).equals(p)) {
                found = true;
                break;
            }
        }

        System.out.println(found ? "Yes" : "No");
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String s = sc.nextLine();
        String p = sc.nextLine();

        String ring = s + s;

        boolean found = false;
        for (int i = 0; i < s.length(); i++) {
            if (ring.substring(i, i + p.length()).equals(p)) {
                found = true;
                break;
            }
        }

        System.out.println(found ? "Yes" : "No");
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String s = sc.nextLine();
        String p = sc.nextLine();

        String ring = s + s;

        boolean found = false;
        for (int i = 0; i < s.length(); i++) {
            if (ring.substring(i, i + p.length()).equals(p)) {
                found = true;
                break;
            }
        }

        System.out.println(found ? "Yes" : "No");
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        String word = scanner.nextLine().toLowerCase();
        int count = 0;

        String line;
        while (!(line = scanner.nextLine()).equals("END_OF_TEXT")) {
            String[] words = line.toLowerCase().split("\\s+");
            for (String w : words) {
                if (w.equals(word)) {
                    count++;
                }
            }
        }

        System.out.println(count);
        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        String word = scanner.nextLine().toLowerCase();
        int count = 0;

        String line;
        while (!(line = scanner.nextLine()).equals("END_OF_TEXT")) {
            String[] words = line.toLowerCase().split("\\s+");
            for (String w : words) {
                if (w.equals(word)) {
                    count++;
                }
            }
        }

        System.out.println(count);
        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        String word = scanner.nextLine().toLowerCase();
        int count = 0;

        String line;
        while (!(line = scanner.nextLine()).equals("END_OF_TEXT")) {
            String[] words = line.toLowerCase().split("\\s+");
            for (String w : words) {
                if (w.equals(word)) {
                    count++;
                }
            }
        }

        System.out.println(count);
        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            String deck = sc.nextLine();
            if (deck.equals("-")) {
                break;
            }

            int m = sc.nextInt();

            for (int i = 0; i < m; i++) {
                int h = sc.nextInt();
                String bottom = deck.substring(0, h);
                String remaining = deck.substring(h);
                deck = remaining + bottom;
            }

            System.out.println(deck);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (true) {
            String deck = sc.nextLine();
            if (deck.equals("-")) {
                break;
            }

            int m = sc.nextInt();

            for (int i = 0; i < m; i++) {
                int h = sc.nextInt();
                String bottom = deck.substring(0, h);
                String remaining = deck.substring(h);
                deck = remaining + bottom;
            }

            System.out.println(deck);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        int taroScore = 0;
        int hanakoScore = 0;

        for (int i = 0; i < n; i++) {
            String taroCard = sc.next();
            String hanakoCard = sc.next();

            int comparison = taroCard.compareTo(hanakoCard);

            if (comparison > 0) {
                taroScore += 3;
            } else if (comparison < 0) {
                hanakoScore += 3;
            } else {
                taroScore += 1;
                hanakoScore += 1;
            }
        }

        System.out.println(taroScore + " " + hanakoScore);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int taroScore = 0;
        int hanakoScore = 0;

        for (int i = 0; i < n; i++) {
            String taroCard = sc.next();
            String hanakoCard = sc.next();

            int compareResult = taroCard.compareTo(hanakoCard);

            if (compareResult > 0) {
                taroScore += 3;
            } else if (compareResult < 0) {
                hanakoScore += 3;
            } else {
                taroScore += 1;
                hanakoScore += 1;
            }
        }
        System.out.println(taroScore + " " + hanakoScore);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {

  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);

    int n = sc.nextInt();
    int taroScore = 0;
    int hanakoScore = 0;

    for (int i = 0; i < n; i++) {
      String taroCard = sc.next();
      String hanakoCard = sc.next();

      int result = taroCard.compareTo(hanakoCard);

      if (result > 0) {
        taroScore += 3;
      } else if (result < 0) {
        hanakoScore += 3;
      } else {
        taroScore += 1;
        hanakoScore += 1;
      }
    }

    System.out.println(taroScore + " " + hanakoScore);

    sc.close();
  }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int taroScore = 0;
        int hanakoScore = 0;
        for (int i = 0; i < n; i++) {
            String taroCard = sc.next();
            String hanakoCard = sc.next();
            int result = taroCard.compareTo(hanakoCard);
            if (result > 0) {
                taroScore += 3;
            } else if (result < 0) {
                hanakoScore += 3;
            } else {
                taroScore += 1;
                hanakoScore += 1;
            }
        }
        System.out.println(taroScore + " " + hanakoScore);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        int taroScore = 0;
        int hanakoScore = 0;

        for (int i = 0; i < n; i++) {
            String taroCard = sc.next();
            String hanakoCard = sc.next();

            int comparison = taroCard.compareTo(hanakoCard);

            if (comparison > 0) {
                taroScore += 3;
            } else if (comparison < 0) {
                hanakoScore += 3;
            } else {
                taroScore += 1;
                hanakoScore += 1;
            }
        }

        System.out.println(taroScore + " " + hanakoScore);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        int taroScore = 0;
        int hanakoScore = 0;

        for (int i = 0; i < n; i++) {
            String taroCard = sc.next();
            String hanakoCard = sc.next();

            int comparison = taroCard.compareTo(hanakoCard);

            if (comparison > 0) {
                taroScore += 3;
            } else if (comparison < 0) {
                hanakoScore += 3;
            } else {
                taroScore += 1;
                hanakoScore += 1;
            }
        }

        System.out.println(taroScore + " " + hanakoScore);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        int taroScore = 0;
        int hanakoScore = 0;

        for (int i = 0; i < n; i++) {
            String taroCard = sc.next();
            String hanakoCard = sc.next();

            int comparison = taroCard.compareTo(hanakoCard);

            if (comparison > 0) {
                taroScore += 3;
            } else if (comparison < 0) {
                hanakoScore += 3;
            } else {
                taroScore += 1;
                hanakoScore += 1;
            }
        }

        System.out.println(taroScore + " " + hanakoScore);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {

  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    int n = sc.nextInt();
    int taroScore = 0;
    int hanakoScore = 0;

    for (int i = 0; i < n; i++) {
      String taroCard = sc.next();
      String hanakoCard = sc.next();

      int cmp = taroCard.compareTo(hanakoCard);

      if (cmp > 0) {
        taroScore += 3;
      } else if (cmp < 0) {
        hanakoScore += 3;
      } else {
        taroScore += 1;
        hanakoScore += 1;
      }
    }
    System.out.println(taroScore + " " + hanakoScore);
    sc.close();
  }
}

import java.util.Scanner;

public class Main {

  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);

    int n = sc.nextInt();
    int taroScore = 0;
    int hanakoScore = 0;

    for (int i = 0; i < n; i++) {
      String taroCard = sc.next();
      String hanakoCard = sc.next();

      int comparison = taroCard.compareTo(hanakoCard);

      if (comparison > 0) {
        taroScore += 3;
      } else if (comparison < 0) {
        hanakoScore += 3;
      } else {
        taroScore += 1;
        hanakoScore += 1;
      }
    }
    System.out.println(taroScore + " " + hanakoScore);
    sc.close();
  }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        int taroScore = 0;
        int hanakoScore = 0;

        for (int i = 0; i < n; i++) {
            String taroCard = sc.next();
            String hanakoCard = sc.next();

            int comparison = taroCard.compareTo(hanakoCard);

            if (comparison > 0) {
                taroScore += 3;
            } else if (comparison < 0) {
                hanakoScore += 3;
            } else {
                taroScore += 1;
                hanakoScore += 1;
            }
        }

        System.out.println(taroScore + " " + hanakoScore);
        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int q = sc.nextInt();

        int[] arr = new int[200000];
        int size = 0;

        for (int i = 0; i < q; i++) {
            int op = sc.nextInt();

            if (op == 0) {
                int x = sc.nextInt();
                arr[size++] = x;
            } else if (op == 1) {
                int p = sc.nextInt();
                System.out.println(arr[p]);
            } else {
                size--;
            }
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int q = sc.nextInt();

        int[] arr = new int[200000];
        int size = 0;

        for (int i = 0; i < q; i++) {
            int op = sc.nextInt();

            if (op == 0) {
                int x = sc.nextInt();
                arr[size++] = x;
            } else if (op == 1) {
                int p = sc.nextInt();
                System.out.println(arr[p]);
            } else {
                size--;
            }
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int q = sc.nextInt();

        int[] arr = new int[200000];
        int size = 0;

        for (int i = 0; i < q; i++) {
            int op = sc.nextInt();

            if (op == 0) {
                int x = sc.nextInt();
                arr[size++] = x;
            } else if (op == 1) {
                int p = sc.nextInt();
                System.out.println(arr[p]);
            } else {
                size--;
            }
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int q = sc.nextInt();

        Stack<Integer>[] stacks = new Stack[n];
        for (int i = 0; i < n; i++) {
            stacks[i] = new Stack<>();
        }

        for (int i = 0; i < q; i++) {
            int op = sc.nextInt();
            if (op == 0) {
                int t = sc.nextInt();
                int x = sc.nextInt();
                stacks[t].push(x);
            } else if (op == 1) {
                int t = sc.nextInt();
                if (!stacks[t].isEmpty()) {
                    System.out.println(stacks[t].peek());
                }
            } else {
                int t = sc.nextInt();
                if (!stacks[t].isEmpty()) {
                    stacks[t].pop();
                }
            }
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int q = sc.nextInt();

        Queue<Integer>[] queues = new Queue[n];
        for (int i = 0; i < n; i++) {
            queues[i] = new ArrayDeque<>();
        }

        for (int i = 0; i < q; i++) {
            int op = sc.nextInt();
            if (op == 0) {
                int t = sc.nextInt();
                int x = sc.nextInt();
                queues[t].offer(x);
            } else if (op == 1) {
                int t = sc.nextInt();
                if (!queues[t].isEmpty()) {
                    System.out.println(queues[t].peek());
                }
            } else {
                int t = sc.nextInt();
                if (!queues[t].isEmpty()) {
                    queues[t].poll();
                }
            }
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int q = sc.nextInt();

        PriorityQueue<Integer>[] queues = new PriorityQueue[n];
        for (int i = 0; i < n; i++) {
            queues[i] = new PriorityQueue<>(Collections.reverseOrder());
        }

        for (int i = 0; i < q; i++) {
            int op = sc.nextInt();
            if (op == 0) {
                int t = sc.nextInt();
                int x = sc.nextInt();
                queues[t].offer(x);
            } else if (op == 1) {
                int t = sc.nextInt();
                if (!queues[t].isEmpty()) {
                    System.out.println(queues[t].peek());
                }
            } else if (op == 2) {
                int t = sc.nextInt();
                if (!queues[t].isEmpty()) {
                    queues[t].poll();
                }
            }
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int q = sc.nextInt();

        PriorityQueue<Integer>[] queues = new PriorityQueue[n];
        for (int i = 0; i < n; i++) {
            queues[i] = new PriorityQueue<>(Collections.reverseOrder());
        }

        for (int i = 0; i < q; i++) {
            int op = sc.nextInt();
            if (op == 0) {
                int t = sc.nextInt();
                int x = sc.nextInt();
                queues[t].add(x);
            } else if (op == 1) {
                int t = sc.nextInt();
                if (!queues[t].isEmpty()) {
                    System.out.println(queues[t].peek());
                }
            } else if (op == 2) {
                int t = sc.nextInt();
                if (!queues[t].isEmpty()) {
                    queues[t].poll();
                }
            }
        }
        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int q = sc.nextInt();

        TreeSet<Integer>[] queues = new TreeSet[n];
        for (int i = 0; i < n; i++) {
            queues[i] = new TreeSet<>(Collections.reverseOrder());
        }

        for (int i = 0; i < q; i++) {
            int op = sc.nextInt();

            if (op == 0) {
                int t = sc.nextInt();
                int x = sc.nextInt();
                queues[t].add(x);
            } else if (op == 1) {
                int t = sc.nextInt();
                if (!queues[t].isEmpty()) {
                    System.out.println(queues[t].first());
                }
            } else if (op == 2) {
                int t = sc.nextInt();
                if (!queues[t].isEmpty()) {
                    queues[t].pollFirst();
                }
            }
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int a = sc.nextInt();
        int b = sc.nextInt();
        int c = sc.nextInt();

        int min = Math.min(Math.min(a, b), c);
        int max = Math.max(Math.max(a, b), c);

        System.out.println(min + " " + max);
    }
}

import java.util.Scanner;

public class MinMax {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int a = scanner.nextInt();
        int b = scanner.nextInt();
        int c = scanner.nextInt();

        int min = Math.min(Math.min(a, b), c);
        int max = Math.max(Math.max(a, b), c);

        System.out.println(min + " " + max);
    }
}

import java.util.Scanner;

public class MinMax {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int a = scanner.nextInt();
        int b = scanner.nextInt();
        int c = scanner.nextInt();

        int min = Math.min(Math.min(a, b), c);
        int max = Math.max(Math.max(a, b), c);

        System.out.println(min + " " + max);
    }
}

import java.util.Scanner;

public class MinMax {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int a = scanner.nextInt();
        int b = scanner.nextInt();
        int c = scanner.nextInt();

        int min = Math.min(Math.min(a, b), c);
        int max = Math.max(Math.max(a, b), c);

        System.out.println(min + " " + max);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        int[] a = new int[n];
        for (int i = 0; i < n; i++) {
            a[i] = sc.nextInt();
        }

        int q = sc.nextInt();
        for (int i = 0; i < q; i++) {
            int com = sc.nextInt();
            int b = sc.nextInt();
            int e = sc.nextInt();

            if (com == 0) {
                int min = a[b];
                for (int j = b + 1; j < e; j++) {
                    if (a[j] < min) {
                        min = a[j];
                    }
                }
                System.out.println(min);
            } else {
                int max = a[b];
                for (int j = b + 1; j < e; j++) {
                    if (a[j] > max) {
                        max = a[j];
                    }
                }
                System.out.println(max);
            }
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        int[] a = new int[n];
        for (int i = 0; i < n; i++) {
            a[i] = sc.nextInt();
        }

        int q = sc.nextInt();
        for (int i = 0; i < q; i++) {
            int com = sc.nextInt();
            int b = sc.nextInt();
            int e = sc.nextInt();

            if (com == 0) {
                int minVal = a[b];
                for (int j = b + 1; j < e; j++) {
                    if (a[j] < minVal) {
                        minVal = a[j];
                    }
                }
                System.out.println(minVal);
            } else {
                int maxVal = a[b];
                for (int j = b + 1; j < e; j++) {
                    if (a[j] > maxVal) {
                        maxVal = a[j];
                    }
                }
                System.out.println(maxVal);
            }
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        int[] a = new int[n];
        for (int i = 0; i < n; i++) {
            a[i] = sc.nextInt();
        }

        int q = sc.nextInt();
        for (int i = 0; i < q; i++) {
            int com = sc.nextInt();
            int b = sc.nextInt();
            int e = sc.nextInt();

            if (com == 0) {
                int min = a[b];
                for (int j = b + 1; j < e; j++) {
                    if (a[j] < min) {
                        min = a[j];
                    }
                }
                System.out.println(min);
            } else {
                int max = a[b];
                for (int j = b + 1; j < e; j++) {
                    if (a[j] > max) {
                        max = a[j];
                    }
                }
                System.out.println(max);
            }
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {

  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);

    int n = sc.nextInt();
    int[] a = new int[n];
    for (int i = 0; i < n; i++) {
      a[i] = sc.nextInt();
    }

    int q = sc.nextInt();
    for (int i = 0; i < q; i++) {
      int com = sc.nextInt();
      int b = sc.nextInt();
      int e = sc.nextInt();

      if (com == 0) {
        int minVal = a[b];
        for (int j = b + 1; j < e; j++) {
          if (a[j] < minVal) {
            minVal = a[j];
          }
        }
        System.out.println(minVal);
      } else {
        int maxVal = a[b];
        for (int j = b + 1; j < e; j++) {
          if (a[j] > maxVal) {
            maxVal = a[j];
          }
        }
        System.out.println(maxVal);
      }
    }

    sc.close();
  }
}

import java.util.Scanner;

public class Main {

  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);

    int n = sc.nextInt();
    int[] a = new int[n];
    for (int i = 0; i < n; i++) {
      a[i] = sc.nextInt();
    }

    int q = sc.nextInt();
    for (int i = 0; i < q; i++) {
      int com = sc.nextInt();
      int b = sc.nextInt();
      int e = sc.nextInt();

      if (com == 0) {
        int minVal = a[b];
        for (int j = b + 1; j < e; j++) {
          if (a[j] < minVal) {
            minVal = a[j];
          }
        }
        System.out.println(minVal);
      } else {
        int maxVal = a[b];
        for (int j = b + 1; j < e; j++) {
          if (a[j] > maxVal) {
            maxVal = a[j];
          }
        }
        System.out.println(maxVal);
      }
    }

    sc.close();
  }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] a = new int[n];
        for (int i = 0; i < n; i++) {
            a[i] = sc.nextInt();
        }
        int q = sc.nextInt();
        for (int i = 0; i < q; i++) {
            int com = sc.nextInt();
            int b = sc.nextInt();
            int e = sc.nextInt();
            if (com == 0) {
                int min = a[b];
                for (int j = b + 1; j < e; j++) {
                    if (a[j] < min) {
                        min = a[j];
                    }
                }
                System.out.println(min);
            } else {
                int max = a[b];
                for (int j = b + 1; j < e; j++) {
                    if (a[j] > max) {
                        max = a[j];
                    }
                }
                System.out.println(max);
            }
        }
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        int[] a = new int[n];
        for (int i = 0; i < n; i++) {
            a[i] = sc.nextInt();
        }

        int q = sc.nextInt();
        for (int i = 0; i < q; i++) {
            int com = sc.nextInt();
            int b = sc.nextInt();
            int e = sc.nextInt();

            if (com == 0) {
                int min = a[b];
                for (int j = b + 1; j < e; j++) {
                    if (a[j] < min) {
                        min = a[j];
                    }
                }
                System.out.println(min);
            } else {
                int max = a[b];
                for (int j = b + 1; j < e; j++) {
                    if (a[j] > max) {
                        max = a[j];
                    }
                }
                System.out.println(max);
            }
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        int[] a = new int[n];
        for (int i = 0; i < n; i++) {
            a[i] = sc.nextInt();
        }

        int q = sc.nextInt();
        for (int i = 0; i < q; i++) {
            int com = sc.nextInt();
            int b = sc.nextInt();
            int e = sc.nextInt();

            if (com == 0) {
                int min = a[b];
                for (int j = b + 1; j < e; j++) {
                    if (a[j] < min) {
                        min = a[j];
                    }
                }
                System.out.println(min);
            } else {
                int max = a[b];
                for (int j = b + 1; j < e; j++) {
                    if (a[j] > max) {
                        max = a[j];
                    }
                }
                System.out.println(max);
            }
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        int[] a = new int[n];
        for (int i = 0; i < n; i++) {
            a[i] = sc.nextInt();
        }

        int q = sc.nextInt();
        for (int i = 0; i < q; i++) {
            int com = sc.nextInt();
            int b = sc.nextInt();
            int e = sc.nextInt();

            if (com == 0) {
                int min = a[b];
                for (int j = b + 1; j < e; j++) {
                    if (a[j] < min) {
                        min = a[j];
                    }
                }
                System.out.println(min);
            } else {
                int max = a[b];
                for (int j = b + 1; j < e; j++) {
                    if (a[j] > max) {
                        max = a[j];
                    }
                }
                System.out.println(max);
            }
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        int[] a = new int[n];
        for (int i = 0; i < n; i++) {
            a[i] = sc.nextInt();
        }

        int q = sc.nextInt();
        for (int i = 0; i < q; i++) {
            int b = sc.nextInt();
            int e = sc.nextInt();
            int k = sc.nextInt();

            int count = 0;
            for (int j = b; j < e; j++) {
                if (a[j] == k) {
                    count++;
                }
            }
            System.out.println(count);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        int[] a = new int[n];
        for (int i = 0; i < n; i++) {
            a[i] = sc.nextInt();
        }

        int q = sc.nextInt();
        for (int i = 0; i < q; i++) {
            int b = sc.nextInt();
            int e = sc.nextInt();
            int k = sc.nextInt();

            int count = 0;
            for (int j = b; j < e; j++) {
                if (a[j] == k) {
                    count++;
                }
            }
            System.out.println(count);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        int[] a = new int[n];
        for (int i = 0; i < n; i++) {
            a[i] = sc.nextInt();
        }

        int q = sc.nextInt();
        for (int i = 0; i < q; i++) {
            int b = sc.nextInt();
            int e = sc.nextInt();
            int k = sc.nextInt();

            int count = 0;
            for (int j = b; j < e; j++) {
                if (a[j] == k) {
                    count++;
                }
            }
            System.out.println(count);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        int[] a = new int[n];
        for (int i = 0; i < n; i++) {
            a[i] = sc.nextInt();
        }

        int q = sc.nextInt();
        for (int i = 0; i < q; i++) {
            int b = sc.nextInt();
            int e = sc.nextInt();
            int k = sc.nextInt();

            int count = 0;
            for (int j = b; j < e; j++) {
                if (a[j] == k) {
                    count++;
                }
            }
            System.out.println(count);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Count {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        int[] a = new int[n];
        for (int i = 0; i < n; i++) {
            a[i] = scanner.nextInt();
        }
        int q = scanner.nextInt();
        for (int i = 0; i < q; i++) {
            int b = scanner.nextInt();
            int e = scanner.nextInt();
            int k = scanner.nextInt();
            int count = 0;
            for (int j = b; j < e; j++) {
                if (a[j] == k) {
                    count++;
                }
            }
            System.out.println(count);
        }
        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        int[] a = new int[n];
        for (int i = 0; i < n; i++) {
            a[i] = sc.nextInt();
        }

        int q = sc.nextInt();
        for (int i = 0; i < q; i++) {
            int b = sc.nextInt();
            int e = sc.nextInt();
            int k = sc.nextInt();

            int count = 0;
            for (int j = b; j < e; j++) {
                if (a[j] == k) {
                    count++;
                }
            }
            System.out.println(count);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] a = new int[n];
        for (int i = 0; i < n; i++) {
            a[i] = sc.nextInt();
        }

        int q = sc.nextInt();
        for (int i = 0; i < q; i++) {
            int b = sc.nextInt();
            int e = sc.nextInt();
            int k = sc.nextInt();

            int count = 0;
            for (int j = b; j < e; j++) {
                if (a[j] == k) {
                    count++;
                }
            }
            System.out.println(count);
        }
        sc.close();
    }
}

import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        int[] a = new int[n];
        for (int i = 0; i < n; i++) {
            a[i] = sc.nextInt();
        }

        int q = sc.nextInt();
        for (int i = 0; i < q; i++) {
            int b = sc.nextInt();
            int e = sc.nextInt();
            int k = sc.nextInt();

            int count = 0;
            for (int j = b; j < e; j++) {
                if (a[j] == k) {
                    count++;
                }
            }
            System.out.println(count);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        int[] A = new int[n];
        for (int i = 0; i < n; i++) {
            A[i] = scanner.nextInt();
        }

        int q = scanner.nextInt();
        for (int i = 0; i < q; i++) {
            int b = scanner.nextInt();
            int e = scanner.nextInt();
            int k = scanner.nextInt();
            int count = 0;
            for (int j = b; j < e; j++) {
                if (A[j] == k) {
                    count++;
                }
            }
            System.out.println(count);
        }
        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        int[] a = new int[n];
        for (int i = 0; i < n; i++) {
            a[i] = sc.nextInt();
        }

        int q = sc.nextInt();
        for (int i = 0; i < q; i++) {
            int b = sc.nextInt();
            int e = sc.nextInt();
            int k = sc.nextInt();

            int count = 0;
            for (int j = b; j < e; j++) {
                if (a[j] == k) {
                    count++;
                }
            }
            System.out.println(count);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        int[] a = new int[n];
        for (int i = 0; i < n; i++) {
            a[i] = sc.nextInt();
        }

        int m = sc.nextInt();
        int[] b = new int[m];
        for (int i = 0; i < m; i++) {
            b[i] = sc.nextInt();
        }

        StringBuilder sbA = new StringBuilder();
        StringBuilder sbB = new StringBuilder();

        for (int i = 0; i < n; i++) {
            sbA.append(String.format("%04d", a[i]));
        }

        for (int i = 0; i < m; i++) {
            sbB.append(String.format("%04d", b[i]));
        }

        String strA = sbA.toString();
        String strB = sbB.toString();

        if (strB.compareTo(strA) > 0) {
            System.out.println(1);
        } else {
            System.out.println(0);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        int[] a = new int[n];
        for (int i = 0; i < n; i++) {
            a[i] = sc.nextInt();
        }

        int m = sc.nextInt();
        int[] b = new int[m];
        for (int i = 0; i < m; i++) {
            b[i] = sc.nextInt();
        }

        StringBuilder sbA = new StringBuilder();
        StringBuilder sbB = new StringBuilder();

        for (int i = 0; i < n; i++) {
            sbA.append(String.format("%04d", a[i]));
        }

        for (int i = 0; i < m; i++) {
            sbB.append(String.format("%04d", b[i]));
        }

        String strA = sbA.toString();
        String strB = sbB.toString();

        if (strB.compareTo(strA) > 0) {
            System.out.println(1);
        } else {
            System.out.println(0);
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        int[] a = new int[n];
        for (int i = 0; i < n; i++) {
            a[i] = sc.nextInt();
        }

        int m = sc.nextInt();
        int[] b = new int[m];
        for (int i = 0; i < m; i++) {
            b[i] = sc.nextInt();
        }

        int minLen = Math.min(n, m);

        for (int i = 0; i < minLen; i++) {
            if (a[i] < b[i]) {
                System.out.println(1);
                return;
            } else if (a[i] > b[i]) {
                System.out.println(0);
                return;
            }
        }

        if (n < m) {
            System.out.println(1);
        } else {
            System.out.println(0);
        }
    }
}

import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        int[] a = new int[n];
        for (int i = 0; i < n; i++) {
            a[i] = sc.nextInt();
        }

        int m = sc.nextInt();
        int[] b = new int[m];
        for (int i = 0; i < m; i++) {
            b[i] = sc.nextInt();
        }

        int minLen = Math.min(n, m);
        for (int i = 0; i < minLen; i++) {
            if (a[i] < b[i]) {
                System.out.println(1);
                return;
            } else if (a[i] > b[i]) {
                System.out.println(0);
                return;
            }
        }

        if (n < m) {
            System.out.println(1);
        } else {
            System.out.println(0);
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        int[] a = new int[n];

        for (int i = 0; i < n; i++) {
            a[i] = sc.nextInt();
        }

        int q = sc.nextInt();

        for (int i = 0; i < q; i++) {
            int b = sc.nextInt();
            int e = sc.nextInt();
            reverse(a, b, e);
        }

        for (int i = 0; i < n; i++) {
            System.out.print(a[i]);
            if (i < n - 1) {
                System.out.print(" ");
            }
        }
        System.out.println();

        sc.close();
    }

    private static void reverse(int[] arr, int start, int end) {
        int left = start;
        int right = end - 1;

        while (left < right) {
            int temp = arr[left];
            arr[left] = arr[right];
            arr[right] = temp;
            left++;
            right--;
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        int[] a = new int[n];

        for (int i = 0; i < n; i++) {
            a[i] = sc.nextInt();
        }

        int q = sc.nextInt();

        for (int i = 0; i < q; i++) {
            int b = sc.nextInt();
            int e = sc.nextInt();
            reverse(a, b, e);
        }

        for (int i = 0; i < n; i++) {
            System.out.print(a[i]);
            if (i < n - 1) {
                System.out.print(" ");
            }
        }
        System.out.println();

        sc.close();
    }

    private static void reverse(int[] arr, int start, int end) {
        int left = start;
        int right = end - 1;

        while (left < right) {
            int temp = arr[left];
            arr[left] = arr[right];
            arr[right] = temp;
            left++;
            right--;
        }
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        int[][] points = new int[n][2];
        for (int i = 0; i < n; i++) {
            points[i][0] = sc.nextInt();
            points[i][1] = sc.nextInt();
        }

        Arrays.sort(points, (a, b) -> {
            if (a[0] != b[0]) {
                return Integer.compare(a[0], b[0]);
            }
            return Integer.compare(a[1], b[1]);
        });

        for (int i = 0; i < n; i++) {
            System.out.println(points[i][0] + " " + points[i][1]);
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        int[][] points = new int[n][2];
        for (int i = 0; i < n; i++) {
            points[i][0] = sc.nextInt();
            points[i][1] = sc.nextInt();
        }

        Arrays.sort(points, (a, b) -> {
            if (a[0] != b[0]) {
                return Integer.compare(a[0], b[0]);
            }
            return Integer.compare(a[1], b[1]);
        });

        for (int i = 0; i < n; i++) {
            System.out.println(points[i][0] + " " + points[i][1]);
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        int[][] points = new int[n][2];
        for (int i = 0; i < n; i++) {
            points[i][0] = sc.nextInt();
            points[i][1] = sc.nextInt();
        }

        Arrays.sort(points, (a, b) -> {
            if (a[0] != b[0]) {
                return Integer.compare(a[0], b[0]);
            }
            return Integer.compare(a[1], b[1]);
        });

        for (int i = 0; i < n; i++) {
            System.out.println(points[i][0] + " " + points[i][1]);
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int q = sc.nextInt();

        Map<String, Integer> map = new HashMap<>();

        for (int i = 0; i < q; i++) {
            int op = sc.nextInt();

            if (op == 0) {
                String key = sc.next();
                int value = sc.nextInt();
                map.put(key, value);
            } else if (op == 1) {
                String key = sc.next();
                System.out.println(map.get(key));
            }
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int q = sc.nextInt();

        Map<String, Integer> map = new HashMap<>();

        for (int i = 0; i < q; i++) {
            int op = sc.nextInt();

            if (op == 0) {
                String key = sc.next();
                int x = sc.nextInt();
                map.put(key, x);
            } else if (op == 1) {
                String key = sc.next();
                System.out.println(map.get(key));
            }
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int q = sc.nextInt();

        Map<String, Integer> map = new HashMap<>();

        for (int i = 0; i < q; i++) {
            int op = sc.nextInt();

            if (op == 0) {
                String key = sc.next();
                int value = sc.nextInt();
                map.put(key, value);
            } else if (op == 1) {
                String key = sc.next();
                System.out.println(map.get(key));
            }
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        System.out.print(n + ":");

        while (n % 2 == 0) {
            System.out.print(" 2");
            n /= 2;
        }

        for (int i = 3; i * i <= n; i += 2) {
            while (n % i == 0) {
                System.out.print(" " + i);
                n /= i;
            }
        }

        if (n > 1) {
            System.out.print(" " + n);
        }

        System.out.println();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        System.out.print(n + ":");

        while (n % 2 == 0) {
            System.out.print(" 2");
            n /= 2;
        }

        for (int i = 3; i * i <= n; i += 2) {
            while (n % i == 0) {
                System.out.print(" " + i);
                n /= i;
            }
        }

        if (n > 1) {
            System.out.print(" " + n);
        }

        System.out.println();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        System.out.print(n + ":");

        while (n % 2 == 0) {
            System.out.print(" 2");
            n /= 2;
        }

        for (int i = 3; i * i <= n; i += 2) {
            while (n % i == 0) {
                System.out.print(" " + i);
                n /= i;
            }
        }

        if (n > 1) {
            System.out.print(" " + n);
        }

        System.out.println();
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        System.out.print(n + ":");

        while (n % 2 == 0) {
            System.out.print(" 2");
            n /= 2;
        }

        for (int i = 3; i * i <= n; i += 2) {
            while (n % i == 0) {
                System.out.print(" " + i);
                n /= i;
            }
        }

        if (n > 1) {
            System.out.print(" " + n);
        }

        System.out.println();
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        System.out.print(n + ":");

        while (n % 2 == 0) {
            System.out.print(" 2");
            n /= 2;
        }

        for (int i = 3; i * i <= n; i += 2) {
            while (n % i == 0) {
                System.out.print(" " + i);
                n /= i;
            }
        }

        if (n > 1) {
            System.out.print(" " + n);
        }

        System.out.println();
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    static final long MOD = 1000000007;

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        long m = sc.nextLong();
        long n = sc.nextLong();

        System.out.println(power(m, n, MOD));
    }

    static long power(long base, long exp, long mod) {
        long result = 1;
        base %= mod;

        while (exp > 0) {
            if (exp % 2 == 1) {
                result = (result * base) % mod;
            }
            base = (base * base) % mod;
            exp /= 2;
        }

        return result;
    }
}

import java.util.Scanner;

public class Main {
    static final long MOD = 1000000007;

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        long m = sc.nextLong();
        long n = sc.nextLong();

        System.out.println(power(m, n, MOD));
    }

    static long power(long base, long exp, long mod) {
        long result = 1;
        base %= mod;

        while (exp > 0) {
            if (exp % 2 == 1) {
                result = (result * base) % mod;
            }
            base = (base * base) % mod;
            exp /= 2;
        }

        return result;
    }
}

import java.util.Scanner;

public class Main {
    private static final long MOD = 1000000007;

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        long m = sc.nextLong();
        long n = sc.nextLong();

        System.out.println(power(m, n, MOD));
    }

    private static long power(long base, long exp, long mod) {
        long result = 1;
        base %= mod;

        while (exp > 0) {
            if (exp % 2 == 1) {
                result = (result * base) % mod;
            }
            base = (base * base) % mod;
            exp /= 2;
        }

        return result;
    }
}

import java.util.Scanner;

public class Main {
    private static final long MOD = 1000000007;

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        long m = sc.nextLong();
        long n = sc.nextLong();

        System.out.println(modPow(m, n, MOD));
    }

    private static long modPow(long base, long exp, long mod) {
        long result = 1;
        base %= mod;

        while (exp > 0) {
            if (exp % 2 == 1) {
                result = (result * base) % mod;
            }
            base = (base * base) % mod;
            exp /= 2;
        }

        return result;
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        long n = sc.nextLong();

        long result = n;
        long temp = n;

        if (temp % 2 == 0) {
            result = result / 2;
            while (temp % 2 == 0) {
                temp /= 2;
            }
        }

        for (long i = 3; i * i <= temp; i += 2) {
            if (temp % i == 0) {
                result = result - result / i;
                while (temp % i == 0) {
                    temp /= i;
                }
            }
        }

        if (temp > 1) {
            result = result - result / temp;
        }

        System.out.println(result);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        long n = sc.nextLong();

        long result = n;
        long temp = n;

        if (temp % 2 == 0) {
            result = result / 2;
            while (temp % 2 == 0) {
                temp /= 2;
            }
        }

        for (long i = 3; i * i <= temp; i += 2) {
            if (temp % i == 0) {
                result = result - result / i;
                while (temp % i == 0) {
                    temp /= i;
                }
            }
        }

        if (temp > 1) {
            result = result - result / temp;
        }

        System.out.println(result);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        long n = sc.nextLong();

        long result = n;
        long temp = n;

        if (temp % 2 == 0) {
            result = result / 2;
            while (temp % 2 == 0) {
                temp /= 2;
            }
        }

        for (long i = 3; i * i <= temp; i += 2) {
            if (temp % i == 0) {
                result = result - result / i;
                while (temp % i == 0) {
                    temp /= i;
                }
            }
        }

        if (temp > 1) {
            result = result - result / temp;
        }

        System.out.println(result);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int K = sc.nextInt();

        StringBuilder sb = new StringBuilder();
        for (int i = 0; i < K; i++) {
            sb.append("ACL");
        }

        System.out.println(sb.toString());
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int K = sc.nextInt();

        StringBuilder result = new StringBuilder();
        for (int i = 0; i < K; i++) {
            result.append("ACL");
        }

        System.out.println(result.toString());
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int K = sc.nextInt();
        StringBuilder sb = new StringBuilder();
        for (int i = 0; i < K; i++) {
            sb.append("ACL");
        }
        System.out.println(sb.toString());
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int K = sc.nextInt();
        StringBuilder sb = new StringBuilder();
        for (int i = 0; i < K; i++) {
            sb.append("ACL");
        }
        System.out.println(sb.toString());
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int K = sc.nextInt();
        StringBuilder sb = new StringBuilder();
        for (int i = 0; i < K; i++) {
            sb.append("ACL");
        }
        System.out.println(sb.toString());
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int K = sc.nextInt();

        StringBuilder result = new StringBuilder();
        for (int i = 0; i < K; i++) {
            result.append("ACL");
        }

        System.out.println(result.toString());
        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int m = sc.nextInt();

        boolean[] visited = new boolean[n + 1];
        List<List<Integer>> adj = new ArrayList<>();

        for (int i = 0; i <= n; i++) {
            adj.add(new ArrayList<>());
        }

        for (int i = 0; i < m; i++) {
            int a = sc.nextInt();
            int b = sc.nextInt();
            adj.get(a).add(b);
            adj.get(b).add(a);
        }

        int components = 0;

        for (int i = 1; i <= n; i++) {
            if (!visited[i]) {
                components++;
                dfs(i, adj, visited);
            }
        }

        System.out.println(components - 1);
    }

    private static void dfs(int node, List<List<Integer>> adj, boolean[] visited) {
        visited[node] = true;
        for (int neighbor : adj.get(node)) {
            if (!visited[neighbor]) {
                dfs(neighbor, adj, visited);
            }
        }
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int m = sc.nextInt();

        boolean[] visited = new boolean[n + 1];
        List<List<Integer>> graph = new ArrayList<>();

        for (int i = 0; i <= n; i++) {
            graph.add(new ArrayList<>());
        }

        for (int i = 0; i < m; i++) {
            int a = sc.nextInt();
            int b = sc.nextInt();
            graph.get(a).add(b);
            graph.get(b).add(a);
        }

        int components = 0;
        for (int i = 1; i <= n; i++) {
            if (!visited[i]) {
                components++;
                dfs(i, graph, visited);
            }
        }

        System.out.println(components - 1);
    }

    private static void dfs(int node, List<List<Integer>> graph, boolean[] visited) {
        visited[node] = true;
        for (int neighbor : graph.get(node)) {
            if (!visited[neighbor]) {
                dfs(neighbor, graph, visited);
            }
        }
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int k = sc.nextInt();
        int[] a = new int[n];

        for (int i = 0; i < n; i++) {
            a[i] = sc.nextInt();
        }

        int[] dp = new int[n];
        Arrays.fill(dp, 1);

        for (int i = 1; i < n; i++) {
            for (int j = 0; j < i; j++) {
                if (Math.abs(a[i] - a[j]) <= k) {
                    dp[i] = Math.max(dp[i], dp[j] + 1);
                }
            }
        }

        int result = 0;
        for (int i = 0; i < n; i++) {
            result = Math.max(result, dp[i]);
        }

        System.out.println(result);
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int k = sc.nextInt();

        int[] a = new int[n];
        for (int i = 0; i < n; i++) {
            a[i] = sc.nextInt();
        }

        int[] dp = new int[n];
        Arrays.fill(dp, 1);

        for (int i = 1; i < n; i++) {
            for (int j = 0; j < i; j++) {
                if (Math.abs(a[i] - a[j]) <= k) {
                    dp[i] = Math.max(dp[i], dp[j] + 1);
                }
            }
        }

        int ans = 0;
        for (int i = 0; i < n; i++) {
            ans = Math.max(ans, dp[i]);
        }

        System.out.println(ans);
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int K = sc.nextInt();
        int[] A = new int[N];

        for (int i = 0; i < N; i++) {
            A[i] = sc.nextInt();
        }

        int[] dp = new int[N];
        Arrays.fill(dp, 1);

        for (int i = 1; i < N; i++) {
            for (int j = 0; j < i; j++) {
                if (Math.abs(A[i] - A[j]) <= K) {
                    dp[i] = Math.max(dp[i], dp[j] + 1);
                }
            }
        }

        int maxLength = 0;
        for (int i = 0; i < N; i++) {
            maxLength = Math.max(maxLength, dp[i]);
        }

        System.out.println(maxLength);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String s = sc.nextLine();

        if (s.endsWith("s")) {
            System.out.println(s + "es");
        } else {
            System.out.println(s + "s");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String S = sc.next();
        if (S.endsWith("s")) {
            System.out.println(S + "es");
        } else {
            System.out.println(S + "s");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        String s = scanner.next();
        if (s.endsWith("s")) {
            System.out.println(s + "es");
        } else {
            System.out.println(s + "s");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String s = sc.next();

        if (s.endsWith("s")) {
            System.out.println(s + "es");
        } else {
            System.out.println(s + "s");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String s = sc.next();

        if (s.endsWith("s")) {
            System.out.println(s + "es");
        } else {
            System.out.println(s + "s");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        String S = scanner.nextLine();

        if (S.endsWith("s")) {
            System.out.println(S + "es");
        } else {
            System.out.println(S + "s");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        String S = scanner.nextLine();
        if (S.endsWith("s")) {
            System.out.println(S + "es");
        } else {
            System.out.println(S + "s");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        String S = scanner.next();
        if (S.endsWith("s")) {
            System.out.println(S + "es");
        } else {
            System.out.println(S + "s");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String s = sc.nextLine();

        if (s.endsWith("s")) {
            System.out.println(s + "es");
        } else {
            System.out.println(s + "s");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String s = sc.next();

        if (s.charAt(s.length() - 1) == 's') {
            System.out.println(s + "es");
        } else {
            System.out.println(s + "s");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String S = sc.nextLine();
        if (S.charAt(S.length() - 1) == 's') {
            System.out.println(S + "es");
        } else {
            System.out.println(S + "s");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        int consecutiveDoublets = 0;

        for (int i = 0; i < n; i++) {
            int d1 = sc.nextInt();
            int d2 = sc.nextInt();

            if (d1 == d2) {
                consecutiveDoublets++;
                if (consecutiveDoublets >= 3) {
                    System.out.println("Yes");
                    return;
                }
            } else {
                consecutiveDoublets = 0;
            }
        }

        System.out.println("No");
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        int consecutiveDoublets = 0;

        for (int i = 0; i < n; i++) {
            int d1 = sc.nextInt();
            int d2 = sc.nextInt();

            if (d1 == d2) {
                consecutiveDoublets++;
                if (consecutiveDoublets >= 3) {
                    System.out.println("Yes");
                    return;
                }
            } else {
                consecutiveDoublets = 0;
            }
        }

        System.out.println("No");
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        int consecutiveDoublets = 0;
        boolean found = false;

        for (int i = 0; i < n; i++) {
            int d1 = sc.nextInt();
            int d2 = sc.nextInt();

            if (d1 == d2) {
                consecutiveDoublets++;
                if (consecutiveDoublets >= 3) {
                    found = true;
                }
            } else {
                consecutiveDoublets = 0;
            }
        }

        System.out.println(found ? "Yes" : "No");
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        int consecutiveDoublets = 0;
        boolean found = false;

        for (int i = 0; i < n; i++) {
            int d1 = sc.nextInt();
            int d2 = sc.nextInt();

            if (d1 == d2) {
                consecutiveDoublets++;
                if (consecutiveDoublets >= 3) {
                    found = true;
                }
            } else {
                consecutiveDoublets = 0;
            }
        }

        System.out.println(found ? "Yes" : "No");
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();

        long count = 0;

        for (int product = 1; product < N; product++) {
            for (int a = 1; a * a <= product; a++) {
                if (product % a == 0) {
                    if (a * a == product) {
                        count++;
                    } else {
                        count += 2;
                    }
                }
            }
        }

        System.out.println(count);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();

        long count = 0;

        for (int product = 1; product < N; product++) {
            for (int a = 1; a * a <= product; a++) {
                if (product % a == 0) {
                    if (a * a == product) {
                        count++;
                    } else {
                        count += 2;
                    }
                }
            }
        }

        System.out.println(count);
    }
}

import java.util.*;

public class Main {
    static final int MOD = 998244353;

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int K = sc.nextInt();

        Set<Integer> S = new HashSet<>();
        for (int i = 0; i < K; i++) {
            int L = sc.nextInt();
            int R = sc.nextInt();
            for (int j = L; j <= R; j++) {
                S.add(j);
            }
        }

        long[] dp = new long[N + 1];
        dp[1] = 1;

        for (int i = 1; i < N; i++) {
            if (dp[i] == 0) continue;
            for (int d : S) {
                if (i + d <= N) {
                    dp[i + d] = (dp[i + d] + dp[i]) % MOD;
                }
            }
        }

        System.out.println(dp[N]);
    }
}

import java.util.*;

public class Main {
    static final int MOD = 998244353;

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int K = sc.nextInt();

        Set<Integer> S = new HashSet<>();
        for (int i = 0; i < K; i++) {
            int L = sc.nextInt();
            int R = sc.nextInt();
            for (int j = L; j <= R; j++) {
                S.add(j);
            }
        }

        long[] dp = new long[N + 1];
        dp[1] = 1;

        for (int i = 1; i < N; i++) {
            if (dp[i] == 0) continue;
            for (int d : S) {
                if (i + d <= N) {
                    dp[i + d] = (dp[i + d] + dp[i]) % MOD;
                }
            }
        }

        System.out.println(dp[N]);
    }
}

import java.util.*;

public class Main {
    static final int MOD = 998244353;

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int K = sc.nextInt();

        Set<Integer> S = new HashSet<>();
        for (int i = 0; i < K; i++) {
            int L = sc.nextInt();
            int R = sc.nextInt();
            for (int j = L; j <= R; j++) {
                S.add(j);
            }
        }

        long[] dp = new long[N + 1];
        dp[1] = 1;

        for (int i = 1; i < N; i++) {
            if (dp[i] == 0) continue;
            for (int d : S) {
                if (i + d <= N) {
                    dp[i + d] = (dp[i + d] + dp[i]) % MOD;
                }
            }
        }

        System.out.println(dp[N]);
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        long N = sc.nextLong();
        long X = sc.nextLong();
        long M = sc.nextLong();

        Map<Long, Integer> seen = new HashMap<>();
        List<Long> sequence = new ArrayList<>();

        long current = X;
        int pos = 0;

        while (!seen.containsKey(current)) {
            seen.put(current, pos);
            sequence.add(current);
            current = (current * current) % M;
            pos++;
        }

        int cycleStart = seen.get(current);
        int cycleLength = pos - cycleStart;

        long sum = 0;

        if (N <= pos) {
            for (int i = 0; i < N; i++) {
                sum += sequence.get(i);
            }
        } else {
            for (int i = 0; i < cycleStart; i++) {
                sum += sequence.get(i);
            }

            long cycleSum = 0;
            for (int i = cycleStart; i < pos; i++) {
                cycleSum += sequence.get(i);
            }

            long remaining = N - cycleStart;
            long fullCycles = remaining / cycleLength;
            long remainder = remaining % cycleLength;

            sum += fullCycles * cycleSum;

            for (int i = 0; i < remainder; i++) {
                sum += sequence.get(cycleStart + i);
            }
        }

        System.out.println(sum);
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        long N = sc.nextLong();
        long X = sc.nextLong();
        long M = sc.nextLong();

        Map<Long, Integer> seen = new HashMap<>();
        List<Long> sequence = new ArrayList<>();

        long current = X;
        int pos = 0;

        while (!seen.containsKey(current)) {
            seen.put(current, pos);
            sequence.add(current);
            current = (current * current) % M;
            pos++;
        }

        int cycleStart = seen.get(current);
        int cycleLength = pos - cycleStart;

        long sum = 0;

        if (N <= pos) {
            for (int i = 0; i < N; i++) {
                sum += sequence.get(i);
            }
        } else {
            for (int i = 0; i < cycleStart; i++) {
                sum += sequence.get(i);
            }

            long cycleSum = 0;
            for (int i = cycleStart; i < pos; i++) {
                cycleSum += sequence.get(i);
            }

            long remaining = N - cycleStart;
            long completeCycles = remaining / cycleLength;
            long remainingElements = remaining % cycleLength;

            sum += completeCycles * cycleSum;

            for (int i = 0; i < remainingElements; i++) {
                sum += sequence.get(cycleStart + i);
            }
        }

        System.out.println(sum);
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int Q = sc.nextInt();

        boolean[] topWhite = new boolean[N + 1];
        boolean[] leftWhite = new boolean[N + 1];

        for (int i = 1; i <= N; i++) {
            topWhite[i] = false;
            leftWhite[i] = false;
        }

        for (int q = 0; q < Q; q++) {
            int type = sc.nextInt();
            int x = sc.nextInt();

            if (type == 1) {
                topWhite[x] = true;
            } else {
                leftWhite[x] = true;
            }
        }

        long blackStones = 0;

        for (int i = 2; i <= N - 1; i++) {
            for (int j = 2; j <= N - 1; j++) {
                if (!topWhite[j] && !leftWhite[i]) {
                    blackStones++;
                }
            }
        }

        System.out.println(blackStones);
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int Q = sc.nextInt();

        boolean[] topWhite = new boolean[N + 1];
        boolean[] leftWhite = new boolean[N + 1];

        for (int i = 1; i <= N; i++) {
            topWhite[i] = false;
            leftWhite[i] = false;
        }

        for (int q = 0; q < Q; q++) {
            int type = sc.nextInt();
            int x = sc.nextInt();

            if (type == 1) {
                topWhite[x] = true;
            } else {
                leftWhite[x] = true;
            }
        }

        long blackStones = 0;

        for (int i = 2; i <= N - 1; i++) {
            for (int j = 2; j <= N - 1; j++) {
                if (!topWhite[j] && !leftWhite[i]) {
                    blackStones++;
                }
            }
        }

        System.out.println(blackStones);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        long a = sc.nextLong();
        long b = sc.nextLong();
        long c = sc.nextLong();
        long d = sc.nextLong();

        long max = Math.max(Math.max(a * c, a * d), Math.max(b * c, b * d));

        System.out.println(max);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        long a = sc.nextLong();
        long b = sc.nextLong();
        long c = sc.nextLong();
        long d = sc.nextLong();

        long max = Math.max(Math.max(a * c, a * d), Math.max(b * c, b * d));

        System.out.println(max);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        long a = sc.nextLong();
        long b = sc.nextLong();
        long c = sc.nextLong();
        long d = sc.nextLong();

        long max = Math.max(Math.max(a * c, a * d), Math.max(b * c, b * d));

        System.out.println(max);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        long a = sc.nextLong();
        long b = sc.nextLong();
        long c = sc.nextLong();
        long d = sc.nextLong();

        long max = Long.MIN_VALUE;
        max = Math.max(max, a * c);
        max = Math.max(max, a * d);
        max = Math.max(max, b * c);
        max = Math.max(max, b * d);

        System.out.println(max);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        long a = sc.nextLong();
        long b = sc.nextLong();
        long c = sc.nextLong();
        long d = sc.nextLong();

        long res = Long.MIN_VALUE;
        res = Math.max(res, a * c);
        res = Math.max(res, a * d);
        res = Math.max(res, b * c);
        res = Math.max(res, b * d);

        System.out.println(res);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        long a = sc.nextLong();
        long b = sc.nextLong();
        long c = sc.nextLong();
        long d = sc.nextLong();

        long max = Long.MIN_VALUE;

        max = Math.max(max, a * c);
        max = Math.max(max, a * d);
        max = Math.max(max, b * c);
        max = Math.max(max, b * d);

        System.out.println(max);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        long a = sc.nextLong();
        long b = sc.nextLong();
        long c = sc.nextLong();
        long d = sc.nextLong();
        long res = Long.MIN_VALUE;
        res = Math.max(res, a * c);
        res = Math.max(res, a * d);
        res = Math.max(res, b * c);
        res = Math.max(res, b * d);
        System.out.println(res);
    }
}

import java.util.Scanner;

public class Main {
    static final long MOD = 1000000007;

    static long power(long base, long exp, long mod) {
        long result = 1;
        base %= mod;
        while (exp > 0) {
            if (exp % 2 == 1) {
                result = (result * base) % mod;
            }
            base = (base * base) % mod;
            exp /= 2;
        }
        return result;
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        long N = sc.nextLong();

        long total = power(10, N, MOD);

        long no_zeros = power(9, N, MOD);

        long no_nines = power(9, N, MOD);

        long no_zeros_no_nines = power(8, N, MOD);

        long result = (total - no_zeros - no_nines + no_zeros_no_nines + 2 * MOD) % MOD;

        System.out.println(result);
    }
}

import java.util.Scanner;

public class Main {
    static final long MOD = 1000000007;

    static long power(long base, long exp, long mod) {
        long result = 1;
        base %= mod;
        while (exp > 0) {
            if (exp % 2 == 1) {
                result = (result * base) % mod;
            }
            base = (base * base) % mod;
            exp /= 2;
        }
        return result;
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        long n = sc.nextLong();

        long total = power(10, n, MOD);

        long without0 = power(9, n, MOD);

        long without9 = power(9, n, MOD);

        long withoutBoth = power(8, n, MOD);

        long result = (total - without0 - without9 + withoutBoth + 2 * MOD) % MOD;

        System.out.println(result);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int S = sc.nextInt();

        final int MOD = 1000000007;
        long[] dp = new long[S + 1];
        dp[0] = 1;

        for (int i = 3; i <= S; i++) {
            for (int j = 3; j <= i; j++) {
                dp[i] = (dp[i] + dp[i - j]) % MOD;
            }
        }

        System.out.println(dp[S]);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int S = sc.nextInt();

        final int MOD = 1000000007;
        long[] dp = new long[S + 1];

        dp[0] = 1;

        for (int i = 1; i <= S; i++) {
            for (int j = 3; j <= i; j++) {
                dp[i] = (dp[i] + dp[i - j]) % MOD;
            }
        }

        System.out.println(dp[S]);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int S = sc.nextInt();

        final int MOD = 1000000007;
        long[] dp = new long[S + 1];
        dp[0] = 1;

        for (int i = 1; i <= S; i++) {
            for (int j = 3; j <= i; j++) {
                dp[i] = (dp[i] + dp[i - j]) % MOD;
            }
        }

        System.out.println(dp[S]);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int S = sc.nextInt();

        final int MOD = 1000000007;
        long[] dp = new long[S + 1];
        dp[0] = 1;

        for (int i = 1; i <= S; i++) {
            for (int j = 3; j <= i; j++) {
                dp[i] = (dp[i] + dp[i - j]) % MOD;
            }
        }

        System.out.println(dp[S]);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        long maxSum = Long.MIN_VALUE;
        long minSum = Long.MAX_VALUE;
        long maxDiff = Long.MIN_VALUE;
        long minDiff = Long.MAX_VALUE;

        for (int i = 0; i < n; i++) {
            long x = sc.nextLong();
            long y = sc.nextLong();

            long sum = x + y;
            long diff = x - y;

            maxSum = Math.max(maxSum, sum);
            minSum = Math.min(minSum, sum);
            maxDiff = Math.max(maxDiff, diff);
            minDiff = Math.min(minDiff, diff);
        }

        long ans = Math.max(maxSum - minSum, maxDiff - minDiff);
        System.out.println(ans);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        long maxSum = Long.MIN_VALUE;
        long minSum = Long.MAX_VALUE;
        long maxDiff = Long.MIN_VALUE;
        long minDiff = Long.MAX_VALUE;

        for (int i = 0; i < n; i++) {
            long x = sc.nextLong();
            long y = sc.nextLong();

            long sum = x + y;
            long diff = x - y;

            maxSum = Math.max(maxSum, sum);
            minSum = Math.min(minSum, sum);
            maxDiff = Math.max(maxDiff, diff);
            minDiff = Math.min(minDiff, diff);
        }

        long result = Math.max(maxSum - minSum, maxDiff - minDiff);
        System.out.println(result);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        long maxSum = Long.MIN_VALUE;
        long minSum = Long.MAX_VALUE;
        long maxDiff = Long.MIN_VALUE;
        long minDiff = Long.MAX_VALUE;

        for (int i = 0; i < n; i++) {
            long x = sc.nextLong();
            long y = sc.nextLong();

            long sum = x + y;
            long diff = x - y;

            maxSum = Math.max(maxSum, sum);
            minSum = Math.min(minSum, sum);
            maxDiff = Math.max(maxDiff, diff);
            minDiff = Math.min(minDiff, diff);
        }

        long result = Math.max(maxSum - minSum, maxDiff - minDiff);
        System.out.println(result);

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();

        long minSum = Long.MAX_VALUE;
        long maxSum = Long.MIN_VALUE;
        long minDiff = Long.MAX_VALUE;
        long maxDiff = Long.MIN_VALUE;

        for (int i = 0; i < N; i++) {
            long x = sc.nextLong();
            long y = sc.nextLong();

            long sum = x + y;
            long diff = x - y;

            minSum = Math.min(minSum, sum);
            maxSum = Math.max(maxSum, sum);
            minDiff = Math.min(minDiff, diff);
            maxDiff = Math.max(maxDiff, diff);
        }

        long ans = Math.max(maxSum - minSum, maxDiff - minDiff);
        System.out.println(ans);

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        int[] a = new int[n];
        int[] b = new int[n];

        for (int i = 0; i < n; i++) {
            a[i] = sc.nextInt();
        }

        for (int i = 0; i < n; i++) {
            b[i] = sc.nextInt();
        }

        List<Integer> bList = new ArrayList<>();
        for (int i = 0; i < n; i++) {
            bList.add(b[i]);
        }

        int[] result = new int[n];
        boolean[] used = new boolean[n];

        for (int i = 0; i < n; i++) {
            boolean found = false;

            for (int j = 0; j < n; j++) {
                if (!used[j] && b[j] != a[i]) {
                    result[i] = b[j];
                    used[j] = true;
                    found = true;
                    break;
                }
            }

            if (!found) {
                System.out.println("No");
                return;
            }
        }

        System.out.println("Yes");
        for (int i = 0; i < n; i++) {
            System.out.print(result[i]);
            if (i < n - 1) System.out.print(" ");
        }
        System.out.println();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        int[] a = new int[n];
        int[] b = new int[n];

        for (int i = 0; i < n; i++) {
            a[i] = sc.nextInt();
        }

        for (int i = 0; i < n; i++) {
            b[i] = sc.nextInt();
        }

        List<Integer> bList = new ArrayList<>();
        for (int i = 0; i < n; i++) {
            bList.add(b[i]);
        }

        int[] result = new int[n];
        boolean[] used = new boolean[n];

        for (int i = 0; i < n; i++) {
            boolean found = false;
            for (int j = 0; j < n; j++) {
                if (!used[j] && b[j] != a[i]) {
                    result[i] = b[j];
                    used[j] = true;
                    found = true;
                    break;
                }
            }

            if (!found) {
                System.out.println("No");
                return;
            }
        }

        System.out.println("Yes");
        for (int i = 0; i < n; i++) {
            System.out.print(result[i]);
            if (i < n - 1) System.out.print(" ");
        }
        System.out.println();
    }
}

import java.util.*;

public class Main {
    static class UnionFind {
        int[] parent, rank;

        UnionFind(int n) {
            parent = new int[n];
            rank = new int[n];
            for (int i = 0; i < n; i++) {
                parent[i] = i;
                rank[i] = 0;
            }
        }

        int find(int x) {
            if (parent[x] != x) {
                parent[x] = find(parent[x]);
            }
            return parent[x];
        }

        void union(int x, int y) {
            int rootX = find(x);
            int rootY = find(y);

            if (rootX != rootY) {
                if (rank[rootX] < rank[rootY]) {
                    parent[rootX] = rootY;
                } else if (rank[rootX] > rank[rootY]) {
                    parent[rootY] = rootX;
                } else {
                    parent[rootY] = rootX;
                    rank[rootX]++;
                }
            }
        }

        boolean connected(int x, int y) {
            return find(x) == find(y);
        }
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int q = sc.nextInt();

        UnionFind uf = new UnionFind(n);

        for (int i = 0; i < q; i++) {
            int t = sc.nextInt();
            int u = sc.nextInt();
            int v = sc.nextInt();

            if (t == 0) {
                uf.union(u, v);
            } else {
                System.out.println(uf.connected(u, v) ? 1 : 0);
            }
        }
    }
}

import java.util.*;

public class Main {
    static class UnionFind {
        int[] parent, rank;

        UnionFind(int n) {
            parent = new int[n];
            rank = new int[n];
            for (int i = 0; i < n; i++) {
                parent[i] = i;
                rank[i] = 0;
            }
        }

        int find(int x) {
            if (parent[x] != x) {
                parent[x] = find(parent[x]);
            }
            return parent[x];
        }

        void union(int x, int y) {
            int rootX = find(x);
            int rootY = find(y);

            if (rootX != rootY) {
                if (rank[rootX] < rank[rootY]) {
                    parent[rootX] = rootY;
                } else if (rank[rootX] > rank[rootY]) {
                    parent[rootY] = rootX;
                } else {
                    parent[rootY] = rootX;
                    rank[rootX]++;
                }
            }
        }

        boolean connected(int x, int y) {
            return find(x) == find(y);
        }
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int q = sc.nextInt();

        UnionFind uf = new UnionFind(n);

        for (int i = 0; i < q; i++) {
            int t = sc.nextInt();
            int u = sc.nextInt();
            int v = sc.nextInt();

            if (t == 0) {
                uf.union(u, v);
            } else {
                System.out.println(uf.connected(u, v) ? 1 : 0);
            }
        }
    }
}

import java.util.*;

public class Main {
    static class UnionFind {
        int[] parent;
        int[] rank;

        public UnionFind(int n) {
            parent = new int[n];
            rank = new int[n];
            for (int i = 0; i < n; i++) {
                parent[i] = i;
                rank[i] = 0;
            }
        }

        public int find(int x) {
            if (parent[x] != x) {
                parent[x] = find(parent[x]);
            }
            return parent[x];
        }

        public void union(int x, int y) {
            int rootX = find(x);
            int rootY = find(y);

            if (rootX != rootY) {
                if (rank[rootX] < rank[rootY]) {
                    parent[rootX] = rootY;
                } else if (rank[rootX] > rank[rootY]) {
                    parent[rootY] = rootX;
                } else {
                    parent[rootY] = rootX;
                    rank[rootX]++;
                }
            }
        }

        public boolean connected(int x, int y) {
            return find(x) == find(y);
        }
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int Q = sc.nextInt();

        UnionFind uf = new UnionFind(N);

        for (int i = 0; i < Q; i++) {
            int t = sc.nextInt();
            int u = sc.nextInt();
            int v = sc.nextInt();

            if (t == 0) {
                uf.union(u, v);
            } else {
                System.out.println(uf.connected(u, v) ? 1 : 0);
            }
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    static class UnionFind {
        int[] parent;
        int[] rank;

        public UnionFind(int n) {
            parent = new int[n];
            rank = new int[n];
            for (int i = 0; i < n; i++) {
                parent[i] = i;
                rank[i] = 0;
            }
        }

        public int find(int x) {
            if (parent[x] != x) {
                parent[x] = find(parent[x]);
            }
            return parent[x];
        }

        public void union(int x, int y) {
            int rootX = find(x);
            int rootY = find(y);

            if (rootX != rootY) {
                if (rank[rootX] < rank[rootY]) {
                    parent[rootX] = rootY;
                } else if (rank[rootX] > rank[rootY]) {
                    parent[rootY] = rootX;
                } else {
                    parent[rootY] = rootX;
                    rank[rootX]++;
                }
            }
        }

        public boolean connected(int x, int y) {
            return find(x) == find(y);
        }
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int Q = sc.nextInt();

        UnionFind uf = new UnionFind(N);

        for (int i = 0; i < Q; i++) {
            int t = sc.nextInt();
            int u = sc.nextInt();
            int v = sc.nextInt();

            if (t == 0) {
                uf.union(u, v);
            } else {
                System.out.println(uf.connected(u, v) ? 1 : 0);
            }
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    static class UnionFind {
        int[] parent;
        int[] rank;

        public UnionFind(int n) {
            parent = new int[n];
            rank = new int[n];
            for (int i = 0; i < n; i++) {
                parent[i] = i;
                rank[i] = 0;
            }
        }

        public int find(int x) {
            if (parent[x] != x) {
                parent[x] = find(parent[x]);
            }
            return parent[x];
        }

        public void union(int x, int y) {
            int rootX = find(x);
            int rootY = find(y);

            if (rootX != rootY) {
                if (rank[rootX] < rank[rootY]) {
                    parent[rootX] = rootY;
                } else if (rank[rootX] > rank[rootY]) {
                    parent[rootY] = rootX;
                } else {
                    parent[rootY] = rootX;
                    rank[rootX]++;
                }
            }
        }

        public boolean isConnected(int x, int y) {
            return find(x) == find(y);
        }
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int Q = sc.nextInt();

        UnionFind uf = new UnionFind(N);

        for (int i = 0; i < Q; i++) {
            int t = sc.nextInt();
            int u = sc.nextInt();
            int v = sc.nextInt();

            if (t == 0) {
                uf.union(u, v);
            } else {
                System.out.println(uf.isConnected(u, v) ? 1 : 0);
            }
        }

        sc.close();
    }
}

import java.util.*;

public class Main {
    static List<List<Integer>> graph, transpose;
    static boolean[] visited;
    static Stack<Integer> finishOrder;
    static List<List<Integer>> sccs;

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int m = sc.nextInt();

        graph = new ArrayList<>();
        transpose = new ArrayList<>();
        for (int i = 0; i < n; i++) {
            graph.add(new ArrayList<>());
            transpose.add(new ArrayList<>());
        }

        for (int i = 0; i < m; i++) {
            int a = sc.nextInt();
            int b = sc.nextInt();
            graph.get(a).add(b);
            transpose.get(b).add(a);
        }

        visited = new boolean[n];
        finishOrder = new Stack<>();
        for (int i = 0; i < n; i++) {
            if (!visited[i]) {
                dfs1(i);
            }
        }

        visited = new boolean[n];
        sccs = new ArrayList<>();
        while (!finishOrder.isEmpty()) {
            int v = finishOrder.pop();
            if (!visited[v]) {
                List<Integer> scc = new ArrayList<>();
                dfs2(v, scc);
                sccs.add(scc);
            }
        }

        System.out.println(sccs.size());
        for (List<Integer> scc : sccs) {
            System.out.print(scc.size());
            for (int v : scc) {
                System.out.print(" " + v);
            }
            System.out.println();
        }
    }

    static void dfs1(int v) {
        visited[v] = true;
        for (int u : graph.get(v)) {
            if (!visited[u]) {
                dfs1(u);
            }
        }
        finishOrder.push(v);
    }

    static void dfs2(int v, List<Integer> scc) {
        visited[v] = true;
        scc.add(v);
        for (int u : transpose.get(v)) {
            if (!visited[u]) {
                dfs2(u, scc);
            }
        }
    }
}

import java.util.*;

public class Main {
    static List<List<Integer>> adj, radj;
    static boolean[] visited;
    static Stack<Integer> finishOrder;
    static List<List<Integer>> sccs;

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int m = sc.nextInt();

        adj = new ArrayList<>();
        radj = new ArrayList<>();
        for (int i = 0; i < n; i++) {
            adj.add(new ArrayList<>());
            radj.add(new ArrayList<>());
        }

        for (int i = 0; i < m; i++) {
            int a = sc.nextInt();
            int b = sc.nextInt();
            adj.get(a).add(b);
            radj.get(b).add(a);
        }

        visited = new boolean[n];
        finishOrder = new Stack<>();
        for (int i = 0; i < n; i++) {
            if (!visited[i]) {
                dfs1(i);
            }
        }

        visited = new boolean[n];
        sccs = new ArrayList<>();
        while (!finishOrder.isEmpty()) {
            int v = finishOrder.pop();
            if (!visited[v]) {
                List<Integer> scc = new ArrayList<>();
                dfs2(v, scc);
                sccs.add(scc);
            }
        }

        System.out.println(sccs.size());
        for (List<Integer> scc : sccs) {
            System.out.print(scc.size());
            for (int v : scc) {
                System.out.print(" " + v);
            }
            System.out.println();
        }
    }

    static void dfs1(int v) {
        visited[v] = true;
        for (int u : adj.get(v)) {
            if (!visited[u]) {
                dfs1(u);
            }
        }
        finishOrder.push(v);
    }

    static void dfs2(int v, List<Integer> scc) {
        visited[v] = true;
        scc.add(v);
        for (int u : radj.get(v)) {
            if (!visited[u]) {
                dfs2(u, scc);
            }
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int D = sc.nextInt();
        int T = sc.nextInt();
        int S = sc.nextInt();

        if (D <= T * S) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int D = sc.nextInt();
        int T = sc.nextInt();
        int S = sc.nextInt();
        if (D <= T * S) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int D = sc.nextInt();
        int T = sc.nextInt();
        int S = sc.nextInt();
        if (D <= T * S) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int D = sc.nextInt();
        int T = sc.nextInt();
        int S = sc.nextInt();

        if (D <= T * S) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int D = scanner.nextInt();
        int T = scanner.nextInt();
        int S = scanner.nextInt();

        if (D <= T * S) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int D = sc.nextInt();
        int T = sc.nextInt();
        int S = sc.nextInt();

        if (D <= T * S) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int D = sc.nextInt();
        int T = sc.nextInt();
        int S = sc.nextInt();

        if (T * S >= D) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int D = sc.nextInt();
        int T = sc.nextInt();
        int S = sc.nextInt();

        if (S * T >= D) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int D = scanner.nextInt();
        int T = scanner.nextInt();
        int S = scanner.nextInt();

        if (S * T >= D) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int D = sc.nextInt();
        int T = sc.nextInt();
        int S = sc.nextInt();

        if (S * T >= D) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int D = sc.nextInt();
        int T = sc.nextInt();
        int S = sc.nextInt();

        if (S * T >= D) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String S = sc.nextLine();
        String T = sc.nextLine();

        int minChanges = Integer.MAX_VALUE;

        for (int i = 0; i <= S.length() - T.length(); i++) {
            int changes = 0;
            for (int j = 0; j < T.length(); j++) {
                if (S.charAt(i + j) != T.charAt(j)) {
                    changes++;
                }
            }
            minChanges = Math.min(minChanges, changes);
        }

        System.out.println(minChanges);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String S = sc.next();
        String T = sc.next();

        int minChanges = Integer.MAX_VALUE;

        for (int i = 0; i <= S.length() - T.length(); i++) {
            int currentChanges = 0;
            for (int j = 0; j < T.length(); j++) {
                if (S.charAt(i + j) != T.charAt(j)) {
                    currentChanges++;
                }
            }
            minChanges = Math.min(minChanges, currentChanges);
        }
        System.out.println(minChanges);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String S = sc.next();
        String T = sc.next();

        int minChanges = Integer.MAX_VALUE;

        for (int i = 0; i <= S.length() - T.length(); i++) {
            int changes = 0;
            for (int j = 0; j < T.length(); j++) {
                if (S.charAt(i + j) != T.charAt(j)) {
                    changes++;
                }
            }
            minChanges = Math.min(minChanges, changes);
        }

        System.out.println(minChanges);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String S = sc.next();
        String T = sc.next();

        int minChanges = Integer.MAX_VALUE;

        for (int i = 0; i <= S.length() - T.length(); i++) {
            int changes = 0;
            for (int j = 0; j < T.length(); j++) {
                if (S.charAt(i + j) != T.charAt(j)) {
                    changes++;
                }
            }
            minChanges = Math.min(minChanges, changes);
        }

        System.out.println(minChanges);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String S = sc.next();
        String T = sc.next();

        int minChanges = Integer.MAX_VALUE;

        for (int i = 0; i <= S.length() - T.length(); i++) {
            int changes = 0;
            for (int j = 0; j < T.length(); j++) {
                if (S.charAt(i + j) != T.charAt(j)) {
                    changes++;
                }
            }
            minChanges = Math.min(minChanges, changes);
        }

        System.out.println(minChanges);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        String S = scanner.nextLine();
        String T = scanner.nextLine();
        int minChanges = Integer.MAX_VALUE;

        for (int i = 0; i <= S.length() - T.length(); i++) {
            int changes = 0;
            for (int j = 0; j < T.length(); j++) {
                if (S.charAt(i + j) != T.charAt(j)) {
                    changes++;
                }
            }
            minChanges = Math.min(minChanges, changes);
        }

        System.out.println(minChanges);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String S = sc.nextLine();
        String T = sc.nextLine();

        int minChanges = Integer.MAX_VALUE;

        for (int i = 0; i <= S.length() - T.length(); i++) {
            int changes = 0;
            for (int j = 0; j < T.length(); j++) {
                if (S.charAt(i + j) != T.charAt(j)) {
                    changes++;
                }
            }
            minChanges = Math.min(minChanges, changes);
        }

        System.out.println(minChanges);
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        long[] a = new long[n];

        for (int i = 0; i < n; i++) {
            a[i] = sc.nextLong();
        }

        long MOD = 1000000007;
        long result = 0;

        for (int i = 0; i < n - 1; i++) {
            for (int j = i + 1; j < n; j++) {
                result = (result + (a[i] * a[j]) % MOD) % MOD;
            }
        }

        System.out.println(result);
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        long[] a = new long[n];

        for (int i = 0; i < n; i++) {
            a[i] = sc.nextLong();
        }

        long mod = 1000000007;
        long result = 0;

        for (int i = 0; i < n - 1; i++) {
            for (int j = i + 1; j < n; j++) {
                result = (result + (a[i] * a[j]) % mod) % mod;
            }
        }

        System.out.println(result);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int X = sc.nextInt();
        int T = sc.nextInt();

        int batches = (N + X - 1) / X;

        int totalTime = batches * T;

        System.out.println(totalTime);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int N = scanner.nextInt();
        int X = scanner.nextInt();
        int T = scanner.nextInt();

        int batches = (N + X - 1) / X;
        int totalTime = batches * T;

        System.out.println(totalTime);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int X = sc.nextInt();
        int T = sc.nextInt();

        int batches = (N + X - 1) / X;
        int totalTime = batches * T;

        System.out.println(totalTime);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int X = sc.nextInt();
        int T = sc.nextInt();
        int batches = (N + X - 1) / X;
        int result = batches * T;
        System.out.println(result);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int X = sc.nextInt();
        int T = sc.nextInt();

        int batches = (N + X - 1) / X;

        int totalTime = batches * T;

        System.out.println(totalTime);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int X = sc.nextInt();
        int T = sc.nextInt();

        int batches = (N + X - 1) / X;
        int totalTime = batches * T;

        System.out.println(totalTime);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String n = sc.next();

        int digitSum = 0;
        for (int i = 0; i < n.length(); i++) {
            digitSum += n.charAt(i) - '0';
        }

        if (digitSum % 9 == 0) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String N = sc.nextLine();
        int sum = 0;
        for (int i = 0; i < N.length(); i++) {
            sum += N.charAt(i) - '0';
        }
        if (sum % 9 == 0) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String N = sc.next();
        int sum = 0;
        for (int i = 0; i < N.length(); i++) {
            sum += N.charAt(i) - '0';
        }
        if (sum % 9 == 0) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String n = sc.nextLine();

        int sum = 0;
        for (int i = 0; i < n.length(); i++) {
            sum += n.charAt(i) - '0';
        }

        if (sum % 9 == 0) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String n = sc.next();

        int sum = 0;
        for (char c : n.toCharArray()) {
            sum += c - '0';
        }

        if (sum % 9 == 0) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String n = sc.next();

        int sum = 0;
        for (char c : n.toCharArray()) {
            sum += c - '0';
        }

        if (sum % 9 == 0) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        long[] a = new long[n];
        for (int i = 0; i < n; i++) {
            a[i] = sc.nextLong();
        }

        long totalStoolHeight = 0;
        long maxHeightSoFar = a[0];

        for (int i = 1; i < n; i++) {
            if (a[i] < maxHeightSoFar) {
                totalStoolHeight += maxHeightSoFar - a[i];
            } else {
                maxHeightSoFar = a[i];
            }
        }

        System.out.println(totalStoolHeight);
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        long[] A = new long[N];
        for (int i = 0; i < N; i++) {
            A[i] = sc.nextLong();
        }
        long total = 0;
        long prevMax = A[0];
        for (int i = 1; i < N; i++) {
            if (A[i] < prevMax) {
                total += prevMax - A[i];
            } else {
                prevMax = A[i];
            }
        }
        System.out.println(total);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String s = sc.next();

        int maxConsecutive = 0;
        int currentConsecutive = 0;

        for (int i = 0; i < s.length(); i++) {
            if (s.charAt(i) == 'R') {
                currentConsecutive++;
                maxConsecutive = Math.max(maxConsecutive, currentConsecutive);
            } else {
                currentConsecutive = 0;
            }
        }

        System.out.println(maxConsecutive);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String s = sc.next();

        int maxConsecutive = 0;
        int currentConsecutive = 0;

        for (int i = 0; i < s.length(); i++) {
            if (s.charAt(i) == 'R') {
                currentConsecutive++;
                maxConsecutive = Math.max(maxConsecutive, currentConsecutive);
            } else {
                currentConsecutive = 0;
            }
        }

        System.out.println(maxConsecutive);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String s = sc.next();

        int maxConsecutive = 0;
        int currentConsecutive = 0;

        for (int i = 0; i < s.length(); i++) {
            if (s.charAt(i) == 'R') {
                currentConsecutive++;
                maxConsecutive = Math.max(maxConsecutive, currentConsecutive);
            } else {
                currentConsecutive = 0;
            }
        }

        System.out.println(maxConsecutive);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String s = sc.next();

        int maxConsecutive = 0;
        int currentConsecutive = 0;

        for (int i = 0; i < s.length(); i++) {
            if (s.charAt(i) == 'R') {
                currentConsecutive++;
                maxConsecutive = Math.max(maxConsecutive, currentConsecutive);
            } else {
                currentConsecutive = 0;
            }
        }

        System.out.println(maxConsecutive);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String S = sc.next();
        int max = 0;
        int current = 0;

        for (int i = 0; i < S.length(); i++) {
            if (S.charAt(i) == 'R') {
                current++;
                max = Math.max(max, current);
            } else {
                current = 0;
            }
        }

        System.out.println(max);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String S = sc.next();
        int max = 0;
        int current = 0;

        for (int i = 0; i < S.length(); i++) {
            if (S.charAt(i) == 'R') {
                current++;
                max = Math.max(max, current);
            } else {
                current = 0;
            }
        }

        System.out.println(max);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String s = sc.next();

        String[] parts = s.split("S");
        int maxConsecutive = 0;

        for (String part : parts) {
            maxConsecutive = Math.max(maxConsecutive, part.length());
        }

        System.out.println(maxConsecutive);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String S = sc.next();
        String[] rainy = S.split("S");
        int max = 0;
        for (String seq : rainy) {
            max = Math.max(max, seq.length());
        }
        System.out.println(max);
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        Map<Integer, Integer> lengthCount = new HashMap<>();

        for (int i = 0; i < n; i++) {
            int length = sc.nextInt();
            lengthCount.put(length, lengthCount.getOrDefault(length, 0) + 1);
        }

        List<Integer> uniqueLengths = new ArrayList<>(lengthCount.keySet());
        Collections.sort(uniqueLengths);

        int result = 0;
        int size = uniqueLengths.size();

        for (int i = 0; i < size; i++) {
            for (int j = i + 1; j < size; j++) {
                for (int k = j + 1; k < size; k++) {
                    int a = uniqueLengths.get(i);
                    int b = uniqueLengths.get(j);
                    int c = uniqueLengths.get(k);

                    if (a + b > c && a + c > b && b + c > a) {
                        result += lengthCount.get(a) * lengthCount.get(b) * lengthCount.get(c);
                    }
                }
            }
        }

        System.out.println(result);
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        Map<Integer, Integer> lengthCount = new HashMap<>();

        for (int i = 0; i < n; i++) {
            int length = sc.nextInt();
            lengthCount.put(length, lengthCount.getOrDefault(length, 0) + 1);
        }

        List<Integer> uniqueLengths = new ArrayList<>(lengthCount.keySet());
        Collections.sort(uniqueLengths);

        int count = 0;
        int size = uniqueLengths.size();

        for (int i = 0; i < size; i++) {
            for (int j = i + 1; j < size; j++) {
                for (int k = j + 1; k < size; k++) {
                    int a = uniqueLengths.get(i);
                    int b = uniqueLengths.get(j);
                    int c = uniqueLengths.get(k);

                    if (a + b > c && a + c > b && b + c > a) {
                        count += lengthCount.get(a) * lengthCount.get(b) * lengthCount.get(c);
                    }
                }
            }
        }

        System.out.println(count);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int X = scanner.nextInt();

        if (X >= 30) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int X = sc.nextInt();
        if (X >= 30) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int X = sc.nextInt();
        if (X >= 30) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int X = sc.nextInt();
        if (X >= 30) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int X = scanner.nextInt();

        if (X >= 30) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int X = sc.nextInt();
        if (X >= 30) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int D = sc.nextInt();

        int count = 0;
        for (int i = 0; i < N; i++) {
            int x = sc.nextInt();
            int y = sc.nextInt();

            if (x * x + y * y <= D * D) {
                count++;
            }
        }

        System.out.println(count);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int D = sc.nextInt();

        int count = 0;
        for (int i = 0; i < N; i++) {
            int x = sc.nextInt();
            int y = sc.nextInt();

            if (x * x + y * y <= D * D) {
                count++;
            }
        }

        System.out.println(count);
        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int K = sc.nextInt();

        Set<Integer> seen = new HashSet<>();
        int remainder = 0;
        int position = 0;

        while (true) {
            remainder = (remainder * 10 + 7) % K;
            position++;

            if (remainder == 0) {
                System.out.println(position);
                return;
            }

            if (seen.contains(remainder)) {
                System.out.println(-1);
                return;
            }

            seen.add(remainder);
        }
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int K = sc.nextInt();

        Set<Integer> seen = new HashSet<>();
        int remainder = 0;
        int position = 0;

        while (true) {
            remainder = (remainder * 10 + 7) % K;
            position++;

            if (remainder == 0) {
                System.out.println(position);
                return;
            }

            if (seen.contains(remainder)) {
                System.out.println(-1);
                return;
            }

            seen.add(remainder);
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int K = sc.nextInt();

        long[] A = new long[N];
        for (int i = 0; i < N; i++) {
            A[i] = sc.nextLong();
        }

        for (int i = K; i < N; i++) {
            if (A[i] > A[i - K]) {
                System.out.println("Yes");
            } else {
                System.out.println("No");
            }
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int K = sc.nextInt();
        long[] A = new long[N];
        for (int i = 0; i < N; i++) {
            A[i] = sc.nextLong();
        }

        for (int i = K; i < N; i++) {
            if (A[i] > A[i - K]) {
                System.out.println("Yes");
            } else {
                System.out.println("No");
            }
        }
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int K = sc.nextInt();
        long[] A = new long[N];
        for (int i = 0; i < N; i++) {
            A[i] = sc.nextLong();
        }

        for (int i = K; i < N; i++) {
            if (A[i] > A[i - K]) {
                System.out.println("Yes");
            } else {
                System.out.println("No");
            }
        }
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int K = sc.nextInt();
        long[] A = new long[N];
        for (int i = 0; i < N; i++) {
            A[i] = sc.nextLong();
        }

        for (int i = K; i < N; i++) {
            if (A[i] > A[i - K]) {
                System.out.println("Yes");
            } else {
                System.out.println("No");
            }
        }
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int K = sc.nextInt();
        long[] A = new long[N];
        for (int i = 0; i < N; i++) {
            A[i] = sc.nextLong();
        }

        for (int i = K; i < N; i++) {
            if (A[i] > A[i - K]) {
                System.out.println("Yes");
            } else {
                System.out.println("No");
            }
        }
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int K = sc.nextInt();
        long[] A = new long[N];
        for (int i = 0; i < N; i++) {
            A[i] = sc.nextLong();
        }

        for (int i = K; i < N; i++) {
            if (A[i] > A[i - K]) {
                System.out.println("Yes");
            } else {
                System.out.println("No");
            }
        }
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int K = sc.nextInt();

        long[] A = new long[N + 1];
        for (int i = 1; i <= N; i++) {
            A[i] = sc.nextLong();
        }

        for (int i = K + 1; i <= N; i++) {
            if (A[i] > A[i - K]) {
                System.out.println("Yes");
            } else {
                System.out.println("No");
            }
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int K = sc.nextInt();

        long[] A = new long[N + 1];
        for (int i = 1; i <= N; i++) {
            A[i] = sc.nextLong();
        }

        for (int i = K + 1; i <= N; i++) {
            if (A[i] > A[i - K]) {
                System.out.println("Yes");
            } else {
                System.out.println("No");
            }
        }

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int L = sc.nextInt();
        int R = sc.nextInt();
        int d = sc.nextInt();

        int firstMultiple = ((L + d - 1) / d) * d;

        int lastMultiple = (R / d) * d;

        if (firstMultiple <= R) {
            int count = (lastMultiple - firstMultiple) / d + 1;
            System.out.println(count);
        } else {
            System.out.println(0);
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int L = sc.nextInt();
        int R = sc.nextInt();
        int d = sc.nextInt();

        int firstMultiple = ((L + d - 1) / d) * d;

        int lastMultiple = (R / d) * d;

        if (firstMultiple <= R) {
            int count = (lastMultiple - firstMultiple) / d + 1;
            System.out.println(count);
        } else {
            System.out.println(0);
        }
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int count = 0;

        for (int i = 1; i <= n; i++) {
            int a = sc.nextInt();
            if (i % 2 == 1 && a % 2 == 1) {
                count++;
            }
        }

        System.out.println(count);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int count = 0;

        for (int i = 1; i <= n; i++) {
            int a = sc.nextInt();
            if (i % 2 == 1 && a % 2 == 1) {
                count++;
            }
        }

        System.out.println(count);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int count = 0;

        for (int i = 1; i <= n; i++) {
            int a = sc.nextInt();
            if (i % 2 == 1 && a % 2 == 1) {
                count++;
            }
        }

        System.out.println(count);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int N = scanner.nextInt();

        int billsNeeded = (N + 999) / 1000;

        int change = billsNeeded * 1000 - N;

        System.out.println(change);

        scanner.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();

        int bills = (N + 999) / 1000;

        int change = bills * 1000 - N;

        System.out.println(change);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();

        int bills = (N + 999) / 1000;

        int change = bills * 1000 - N;

        System.out.println(change);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();

        int bills = (N + 999) / 1000;

        int change = bills * 1000 - N;

        System.out.println(change);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int bills = (N + 999) / 1000;
        int change = bills * 1000 - N;
        System.out.println(change);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int bills = (N + 999) / 1000;
        int change = bills * 1000 - N;
        System.out.println(change);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        int ac = 0, wa = 0, tle = 0, re = 0;

        for (int i = 0; i < n; i++) {
            String verdict = sc.next();
            switch (verdict) {
                case "AC":
                    ac++;
                    break;
                case "WA":
                    wa++;
                    break;
                case "TLE":
                    tle++;
                    break;
                case "RE":
                    re++;
                    break;
            }
        }

        System.out.println("AC x " + ac);
        System.out.println("WA x " + wa);
        System.out.println("TLE x " + tle);
        System.out.println("RE x " + re);

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        int ac = 0, wa = 0, tle = 0, re = 0;

        for (int i = 0; i < n; i++) {
            String verdict = sc.next();
            switch (verdict) {
                case "AC":
                    ac++;
                    break;
                case "WA":
                    wa++;
                    break;
                case "TLE":
                    tle++;
                    break;
                case "RE":
                    re++;
                    break;
            }
        }

        System.out.println("AC x " + ac);
        System.out.println("WA x " + wa);
        System.out.println("TLE x " + tle);
        System.out.println("RE x " + re);

        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        int ac = 0, wa = 0, tle = 0, re = 0;

        for (int i = 0; i < n; i++) {
            String verdict = sc.next();
            switch (verdict) {
                case "AC":
                    ac++;
                    break;
                case "WA":
                    wa++;
                    break;
                case "TLE":
                    tle++;
                    break;
                case "RE":
                    re++;
                    break;
            }
        }

        System.out.println("AC x " + ac);
        System.out.println("WA x " + wa);
        System.out.println("TLE x " + tle);
        System.out.println("RE x " + re);

        sc.close();
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        Map<String, Integer> counts = new HashMap<>();
        counts.put("AC", 0);
        counts.put("WA", 0);
        counts.put("TLE", 0);
        counts.put("RE", 0);

        for (int i = 0; i < n; i++) {
            String verdict = sc.next();
            counts.put(verdict, counts.get(verdict) + 1);
        }

        System.out.println("AC x " + counts.get("AC"));
        System.out.println("WA x " + counts.get("WA"));
        System.out.println("TLE x " + counts.get("TLE"));
        System.out.println("RE x " + counts.get("RE"));
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        Map<String, Integer> count = new HashMap<>();
        count.put("AC", 0);
        count.put("WA", 0);
        count.put("TLE", 0);
        count.put("RE", 0);

        for (int i = 0; i < n; i++) {
            String verdict = sc.next();
            count.put(verdict, count.get(verdict) + 1);
        }

        System.out.println("AC x " + count.get("AC"));
        System.out.println("WA x " + count.get("WA"));
        System.out.println("TLE x " + count.get("TLE"));
        System.out.println("RE x " + count.get("RE"));
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int H = sc.nextInt();
        int W = sc.nextInt();
        int K = sc.nextInt();

        char[][] grid = new char[H][W];
        for (int i = 0; i < H; i++) {
            grid[i] = sc.next().toCharArray();
        }

        int count = 0;

        for (int rowMask = 0; rowMask < (1 << H); rowMask++) {
            for (int colMask = 0; colMask < (1 << W); colMask++) {
                int blackCount = 0;

                for (int i = 0; i < H; i++) {
                    for (int j = 0; j < W; j++) {
                        if (grid[i][j] == '#') {
                            boolean rowPainted = (rowMask & (1 << i)) != 0;
                            boolean colPainted = (colMask & (1 << j)) != 0;

                            if (!rowPainted && !colPainted) {
                                blackCount++;
                            }
                        }
                    }
                }

                if (blackCount == K) {
                    count++;
                }
            }
        }

        System.out.println(count);
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int H = sc.nextInt();
        int W = sc.nextInt();
        int K = sc.nextInt();

        char[][] grid = new char[H][W];
        for (int i = 0; i < H; i++) {
            grid[i] = sc.next().toCharArray();
        }

        int count = 0;

        for (int rowMask = 0; rowMask < (1 << H); rowMask++) {
            for (int colMask = 0; colMask < (1 << W); colMask++) {
                int blackRemaining = 0;

                for (int i = 0; i < H; i++) {
                    for (int j = 0; j < W; j++) {
                        if (grid[i][j] == '#') {
                            boolean rowPainted = (rowMask & (1 << i)) != 0;
                            boolean colPainted = (colMask & (1 << j)) != 0;

                            if (!rowPainted && !colPainted) {
                                blackRemaining++;
                            }
                        }
                    }
                }

                if (blackRemaining == K) {
                    count++;
                }
            }
        }

        System.out.println(count);
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int H = sc.nextInt();
        int W = sc.nextInt();
        int K = sc.nextInt();

        char[][] grid = new char[H][W];
        for (int i = 0; i < H; i++) {
            grid[i] = sc.next().toCharArray();
        }

        int count = 0;

        for (int rowMask = 0; rowMask < (1 << H); rowMask++) {
            for (int colMask = 0; colMask < (1 << W); colMask++) {
                int blackCount = 0;

                for (int i = 0; i < H; i++) {
                    for (int j = 0; j < W; j++) {
                        if (grid[i][j] == '#') {
                            boolean rowPainted = (rowMask & (1 << i)) != 0;
                            boolean colPainted = (colMask & (1 << j)) != 0;

                            if (!rowPainted && !colPainted) {
                                blackCount++;
                            }
                        }
                    }
                }

                if (blackCount == K) {
                    count++;
                }
            }
        }

        System.out.println(count);
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int H = sc.nextInt();
        int W = sc.nextInt();
        int K = sc.nextInt();

        char[][] grid = new char[H][W];
        for (int i = 0; i < H; i++) {
            grid[i] = sc.next().toCharArray();
        }

        int count = 0;

        for (int rowMask = 0; rowMask < (1 << H); rowMask++) {
            for (int colMask = 0; colMask < (1 << W); colMask++) {
                int blackRemaining = 0;

                for (int i = 0; i < H; i++) {
                    for (int j = 0; j < W; j++) {
                        if (grid[i][j] == '#') {
                            boolean rowSelected = (rowMask & (1 << i)) != 0;
                            boolean colSelected = (colMask & (1 << j)) != 0;

                            if (!rowSelected && !colSelected) {
                                blackRemaining++;
                            }
                        }
                    }
                }

                if (blackRemaining == K) {
                    count++;
                }
            }
        }

        System.out.println(count);
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int a = sc.nextInt();
        int result = a + a * a + a * a * a;
        System.out.println(result);
        sc.close();
    }
}

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int a = sc.nextInt();
        int result = a + a * a + a * a * a;
        System.out.println(result);
        sc.close();
    }
}